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*.
n=int(input())
a=list(map(int, input().split()))
ans=0
k=int(sum(a)/n)
c=[ k for i in range(n)]
while a!=c:
    index=a.index(max(a))
    if sum(a[:index])<k*len(a[:index]):
        while sum(a[:index])!=k*len(a[:index]) and a[index]>=k:
            a[index-1]+=1
            ans+=1
            a[index]-=1
    elif sum(a[index+1:])<k*len(a[index+1:]):
        while sum(a[index+1:])!=k*len(a[index+1:]):
            a[index+1]+=1
            ans+=1
            a[index]-=1
print(ans)
