Petya has *k* matches, placed in *n* matchboxes lying in a line from left to right. We know that *k* is divisible by *n*. Petya wants all boxes to have the same number of matches inside. For that, he can move a match from its box to the adjacent one in one move. How many such moves does he need to achieve the desired configuration?
The first line contains integer *n* (1 ≤ *n* ≤ 50000). The second line contains *n* non-negative numbers that do not exceed 10<sup class="upper-index">9</sup>, the *i*-th written number is the number of matches in the *i*-th matchbox. It is guaranteed that the total number of matches is divisible by *n*.
x = int(input())
y = sorted(list(map(int, input().split())))
z=sum(y)
t=sum(y)//x
c=0
for i in range(z):
	if(y[i]<t):
		c += t-y[i]
		y[i] = t
	if(y[i]>t):
		c += y[i] - t
		y[i] = t
	if(y[x-1] == t):
		break
print(c)