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, str.split(input())))
goal = sum(a) // n

steps = 0
stack = 0
for i in range(n):

    a[i], stack = min(goal, a[i] + stack), max(0, a[i] + stack - goal)
    while a[i] < goal:

        for j in range(i + 1, n):

            if a[j] > goal:

                steps += (j - i) * (min(goal, a[i] + a[j] - goal) - a[i])
                a[i], a[j] = sorted((goal, a[i] + a[j] - goal))

    steps += stack

print(steps)
