CANDY3  Candy III
A class went to a school trip. And, as usually, all N kids have got their backpacks stuffed with candy. But soon quarrels started all over the place, as some of the kids had more candies than others. Soon, the teacher realized that he has to step in: "Everybody, listen! Put all the candies you have on this table here!"
Soon, there was quite a large heap of candies on the teacher's table. "Now, I will divide the candies into N equal heaps and everyone will get one of them." announced the teacher.
"Wait, is this really possible?" wondered some of the smarter kids.
Problem specification
You are given the number of candies each child brought. Find out whether the teacher can divide the candies into N exactly equal heaps. (For the purpose of this task, all candies are of the same type.)
Input specification
The first line of the input file contains an integer T specifying the number of test cases. Each test case is preceded by a blank line.
Each test case looks as follows: The first line contains N : the number of children. Each of the next N lines contains the number of candies one child brought.
Output specification
For each of the test cases output a single line with a single word "YES" if the candies can be distributed equally, or "NO" otherwise.
Example
Input: 2 5 5 2 7 3 8 6 7 11 2 7 3 4 Output: YES NONote: the input file will not exceed 1MB.
hide comments
abhinav_99:
20190108 19:38:34
use modular division in every iteration otherwise WA


sanchit_aga:
20190106 16:59:11
I have never spent this much time trying to figure out how to take the input. In the end, I read the input line by line in Python3 using 


mukulsingh:
20190104 19:14:24


laidactienbn:
20181104 16:33:04
For NZEC runtime error in python 3:


midoriya:
20181027 12:49:13
how should i take input cant figure it out please help i'm doing it in c++ 

anant6025:
20180919 10:50:36
Just Google up the properties of the modulous function and code those which u think can be helpful for you in this problem.


probeta:
20180830 16:09:21
Think over the fact that range for number of candies is not given , so it can be very very large :) 

sktspoj:
20180726 21:05:48
instead of getting the sum of all n and getting wa ....... just use modular division in every iteration and get ac. as range is not given 

khoaph:
20180629 05:18:05
use long long or get wrong answer 

techlicious_:
20180618 21:03:57
getting a NZEC in python 3 can anyone tell me why??

Added by:  Fudan University Problem Setters 
Date:  20071201 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO 
Resource:  IPSC 2006 