#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
 
int C[MAXN];
LL num[MAXN];
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int n, i, j, temp;
    while (~scanf("%d", &n))
    {
        LL sum = 0, ans = 0;
        C[0] = 0;
        for (i = 1; i <= n; i++)
        {
            scanf("%lld", #[i]);
            sum += num[i];
        }
        LL M = sum / n;
        for (i = 1; i < n; i++)
            C[i] = C[i - 1] + num[i] - M;
        sort(C, C + n);
        LL k = C[n / 2];
        for (i = 0; i < n; i++)
            ans += abs(k - C[i]);
        printf("%lld\n", ans);
    }
    return 0;
}