440_B. Balancer_17192
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?

Input

The first line contains integer n (1 ≤ n ≤ 50000). The second line contains n non-negative numbers that do not exceed 109, 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.

Output

Print the total minimum number of moves.

Examples

Input

6
1 6 2 5 3 7


Output

12
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50005;
int n, in[MAXN];
long long k, ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> in[i];
    k += in[i];
  }
  k /= n;
  long long c = in[0] - k;
  for (int i = 1; i < n; ++i) {
    ans += abs(c);
    c += in[i];
    c -= k;
  }
  cout << ans << endl;
  return 0;
}
