Doremy's Paint 3
An array $$$b_1, b_2, \ldots, b_n$$$ of positive integers is good if all the sums of two adjacent elements are equal to the same value. More formally, the array is good if there exists a $$$k$$$ such that $$$b_1 + b_2 = b_2 + b_3 = \ldots = b_{n-1} + b_n = k$$$.Doremy has an array $$$a$$$ of length $$$n$$$. Now Doremy can permute its elements (change their order) however she wants. Determine if she can make the array good.
In the first test case, $$$[8,9]$$$ and $$$[9,8]$$$ are good.In the second test case, $$$[1,2,1]$$$ is good because $$$a_1+a_2=a_2+a_3=3$$$.In the third test case, it can be shown that no permutation is good.
The input consists of multiple test cases. The first line contains a single integer $$$t$$$ ($$$1\le t\le 100$$$) — the number of test cases. The description of the test cases follows.The first line of each test case contains a single integer $$$n$$$ ($$$2 \le n \le 100$$$) — the length of the array $$$a$$$.The second line of each test case contains $$$ n $$$ integers $$$ a_1,a_2,\ldots,a_n $$$ ($$$1 \le a_i \le 10^5$$$).There are no constraints on the sum of $$$n$$$ over all test cases.
For each test case, print "Yes" (without quotes), if it is possible to make the array good, and "No" (without quotes) otherwise.You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
""""""

def i():
    n = int(input())
    s = input().split()
    tp = set(s)
    if len(tp) < 3:
        if len(tp) == 1:
            return 'YES'
        c = n // 2
        d = c + n % 2
        if c <= s.count(s[0]) <= d:
            return 'YES'
    return 'NO'
t = int(input())
a = []
for _ in range(t):
    a.append(i())
print('\n'.join(a))
def solve():
    n = int(input())
    v = [int(i) for i in input().split()]
    mp = {}
    for i in range(n):
        if mp.__contains__(v[i]):
            mp[v[i]] += 1
        else:
            mp[v[i]] = 1
    if len(mp) > 2:
        print('NO')
    elif len(mp) == 1:
        print('YES')
    else:
        (x, y) = (0, 0)
        for (i, j) in mp.items():
            if x == 0:
                x = j
            else:
                y = j
        if abs(x - y) < 2:
            print('YES')
        else:
            print('NO')
t = int(input())
for i in range(t):
    solve()
import sys
input = sys.stdin.readline

def inp():
    return int(input())

def inlt():
    return list(map(int, input().split()))

def insr():
    return input().strip()

def calculate(numbers, n):
    unique = {}
    for num in numbers:
        if not num in unique:
            unique[num] = 0
        unique[num] += 1
    if len(unique) == 1:
        return 'Yes'
    if len(unique) == 2:
        keys = list(unique.keys())
        diff = abs(unique[keys[0]] - unique[keys[1]])
        return 'Yes' if diff == 0 or diff == 1 else 'No'
    return 'No'
n = inp()
for i in range(n):
    no = inp()
    a = inlt()
    print(calculate(a, no))