There are $N$ friends in a group. Each of them have $A_{i}$ candies.
Can they share all of these candies among themselves such that each one of them have equal no. of candies.

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- First line of each testcase contains of a single line of input, an integer $N$ denoting no. of friends in the group. 
- Next line contains $N$ space separated integers $A_{i}$  denoting the no. candies  $i^{th}$ friend has.

-----Output:-----
For each testcase, output $"Yes"$ if it is possible to share equally else $"No"$ (without " ").

-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 100$
- $0 \leq A_{i} \leq 1000$

-----Sample Input:-----
1

3

1 2 3

-----Sample Output:-----
Yes

-----EXPLANATION:-----
Each of them have $2$ candies after sharing.

Difficulty: UNKNOWN_DIFFICULTY

Starter code:

Solutions:
for _ in range(int(input())):
	friends = int(input())
	candies = list(map(int, input().split()))
	if sum(candies) % friends == 0:
		print('Yes')
	else:
		print('No')


t = input()
for i in range(int(t)):
	n = int(input())
	l = list(map(int, input().split()))
	if sum(l) % n == 0:
		print('Yes')
	else:
		print('No')


a = int(input())
for i in range(a):
	b = int(input())
	c = list(map(int, input().rstrip().split()))
	if sum(c) % b == 0:
		print('Yes')
	else:
		print('No')


for i in range(int(input())):
	n = int(input())
	m = [int(i) for i in input().split()]
	chk = sum(m)
	if chk % n == 0:
		print('Yes')
	else:
		print('No')


test = int(input())
while test > 0:
	n = int(input())
	l = list(map(int, input().split()))
	cnt = 0
	for x in l:
		if x > 1:
			cnt += x - 1
	if cnt % n == 0:
		print('Yes')
	else:
		print('No')
	test -= 1


for i in range(int(input())):
	n = int(input())
	array = list(map(int, input().split()))
	sums = sum(array)
	if sums // n == sums / n:
		print('Yes')
	else:
		print('No')


for i in range(int(input())):
	n = int(input())
	m = list(map(int, input().split()))
	s = sum(m)
	if s % n == 0:
		print('Yes')
	else:
		print('No')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 0:
		print('No')
	else:
		x = sum(a) // n
		if x * n == sum(a):
			print('Yes')
		else:
			print('No')


itr = int(input())
while itr:
	itr = itr - 1
	n = int(input())
	inp = [int(n) for n in input().split()]
	ans = 'Yes' if sum(inp) % n == 0 else 'No'
	print(ans)


try:
	for _ in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		s = sum(a)
		if s % n == 0:
			print('Yes')
		else:
			print('No')
except:
	pass


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(k) for k in input().split()]
	if sum(a) // n == sum(a) / n:
		print('Yes')
	else:
		print('No')


for _ in range(int(input())):
	n = int(input())
	l1 = list(map(int, input().split()))
	if sum(l1) % n == 0:
		print('Yes')
	else:
		print('No')


t = int(input())
for _ in range(t):
	n = int(input())
	ls = list(map(int, input().split()))
	p = sum(ls)
	if p % n == 0:
		print('Yes')
	else:
		print('No')


T = int(input())
while T < 1 or T > 10:
	T = int(input())
for i in range(T):
	n = int(input())
	a = list(map(int, input().strip().split(' ')))
	sum = 0
	k = 0
	for j in a:
		sum = sum + j
		k = k + 1
	avg = sum / k
	if avg % 1 == 0:
		print('Yes')
	else:
		print('No')


T = int(input())
for i in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	if sum(A) % N == 0:
		print('Yes')
	else:
		print('No')


t = input()
for i in range(int(t)):
	n = int(input())
	a = input()
	arr = [int(x) for x in a.split()]
	ans = sum(arr) / n
	if int(ans) == ans:
		print('Yes')
	else:
		print('No')