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*.
from sys import stdin as cin,stdout as cout
from math import factorial as f
from itertools import combinations as comb
n = int(cin.readline())

a = list(map(int,cin.readline().split()))

k = int(sum(a)/n)
sum = 0
for x in a:
  sum+= abs(x-k)
print(sum)