# [Solution] Array Equality solution codechef

## Array Equality solution codechef

Array Equality solution codechef – Chef has an array of N integers. Chef can rearrange this array in any manner.

Chef doesn’t like the array if any two adjacent elements are equal. Determine whether there exists a rearrangement of the array that Chef likes.

### Input Format

• The first line will contain T – the number of test cases. Then the test cases follow.
• First line of each test case contains a single integer N – size of the array A.
• Second line of each test case contains N space-separated integers – denoting the elements of array A.

## Array Equality solution codechef

For each test case, if Chef can like any rearrangement of the array print YES, otherwise print NO.

You may print each character of the string in uppercase or lowercase (for example, the strings yesyEsYeS, and YES will all be treated as identical).

### Constraints

• 1 \leq T \leq 10^5
• 2 \leq N \leq 10^5
• -10^9 \leq A_i \leq 10^9
• Sum of N over all test cases does not exceed 2 \cdot 10^5.

## Array Equality solution codechef

Input

Output

2
5
1 1 1 1 1
3
3 3 4

No
Yes


## Array Equality solution codechef

Test case 1: There exists no rearrangement of the array which Chef will like.

Test case 2: A rearrangement of the array that Chef likes is [3, 4, 3]. Note that in this rearrangement, no two adjacent elements are equal.