One day, GK was getting very bored with palying stones. So he made a rule for himself:
There are n piles of stones in total, at least 0 stones in each pile. You can select a pile of stones each time you move, and then take out one stone from each other (n-1 in total) and put them into the selected pile. The number of stones in any pile at any time cannot be less than 0.That is to say, before you select a pile of stones to add to it, if there have a pile of 0 stones in other piles, you will not be able to select this pile of stones.(For example，there are 3 piles of stones，1 4 1，If you choose the second pile, it will become 0 6 0，and you won't be able to do anything next )
GK wants to know if he can make every pile of stones equal by lots of operation as many times as he want. GK never does anything uncertain, so after a long meditation, he decides to ask for your help.

The first line is an integer T (1 ≤ T ≤ 1000), indicates that there are T-group data.
Each group of test data has two lines, the first line has an integer n (1≤n≤100), which means there are n piles of stones, the second line has n integers a1, a2......an (0 ≤ai ≤1000), which means the number of stones in each pile.

Each group of test data corresponds to an output. If GK can meet the requirements after any number of operations,print"Yes". Otherwise, print "No". 
There is no extra space at the beginning and end of the line, and each group of output takes up one line.

2
3
1 2 3
3
2 2 2

No
Yes