#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn = 100000 + 10;
long long A[maxn],C[maxn], tot, M;
int main(){
    int n;
    while(scanf("%d",&n) == 1){ //輸入數(shù)據(jù)不大,scanf 比cin快
        tot = 0;
        for(int i = 1; i <= n; i++){
            scanf("%lld",&A[i]);
            tot += A[i];
        }
        M = tot /n;
        C[0] = 0;
        for(int i = 0; i < n; i++)
            C[i] = C[i-1] + A[i] - M; // 遞推C數(shù)組
            sort(C,C+n);
        long long x1 = C[n/2],ans = 0; // 計(jì)算x1
        for(int i = 0; i < n; i++)
            ans += abs(x1 - C[i]);

        // 把x 帶入，計(jì)算轉(zhuǎn)手的總金幣數(shù)
        printf("%lld",ans);
    }
    return 0;
}