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*.
a=int(input(""))
hello=input("").split(' ')
hello=[int(x) for x in hello]
m=0
for g in range (0,len(hello)):
   m=m+hello[g]
k=m/a
ans=0
for g in range (0,a-1):
    if (hello[g]>k):
        ans=ans+hello[g]-k
        hello[g+1]=hello[g+1]+hello[g]-k
        hello[g]=k
    else:
        ium=k-hello[g]
        r=0
        for kk in range (g+1, a):
            if (r+hello[kk]<=ium):
                ans=ans+hello[kk]*(kk-g)
                r=r+hello[kk]
                hello[kk]=0
            else:
                u=ium-r
                r=ium
                hello[kk]=hello[kk]-u
                ans=ans+(kk-g)*u
                break
        hello[g]=k
print(int(ans))
