CANDY  Candy I
Jennifer is a teacher in the first year of a primary school. She has gone for a trip with her class today. She has taken a packet of candies for each child. Unfortunatelly, the sizes of the packets are not the same.
Jennifer is afraid that each child will want to have the biggest packet of candies and this will lead to quarrels or even fights among children. She wants to avoid this. Therefore, she has decided to open all the packets, count the candies in each packet and move some candies from bigger packets to smaller ones so that each packet will contain the same number of candies. The question is how many candies she has to move.
Input specification
The input file consists of several blocks of data. Each block starts with the number of candy packets N(1<= N <=10000) followed by N integers (each less than 1000) in separate lines, giving the number of candies in each packet. After the last block of data there is the number 1.
Output specification
The output file should contain one line with the smallest number of moves for each block of data. One move consists of taking one candy from a packet and putting it into another one. If it is not possible to have the same number of candies in each packet, output the number 1.
Example
Input file: 5 1 1 1 1 6 2 3 4 1 Output file: 4 1
hide comments
aditya1345:
20170715 13:12:46
I cant understand the sample test case. When N=5 then why there are more than 5 integers beneath?


YeisonEduardo:
20170625 00:19:43
wrong answer =( why?


techventer_936:
20170624 08:30:56
Check for array size!!!


balaram_tupili:
20170621 10:20:26
understanding the format of input and output is also important !!! 

sandeep_4141:
20170611 08:48:09
problem should move into basic !!


nveenjain:
20170530 23:00:52
AC in one go :) very easy.. 

baby_doll:
20170527 22:47:01
@sudheer14 Dont go for solutions bro.Try yourself


sudheer14:
20170527 19:30:25
How can I find solutions


nitisha1:
20170326 05:40:03
AC in one go:)


masterbios:
20170314 08:37:06
Too much thinking will cost you WA! 
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 1999 