#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cmath>

#define RPE(i,n) for(int i=1;i<=(n);i++)

typedef long long LL;

const int maxn=1e6+;

LL a[maxn],c[maxn];

using namespace std;

int main()

{

    ios::sync_with_stdio(false);

    int n,ca=;

    while(cin>>n)

    {

        LL sum=;

        RPE(i,n)

        {

         cin>>a[i];

         sum+=a[i];

        }

        LL m=sum/n;

        c[]=;

        RPE(i,n)

        {

            c[i]=c[i-]-(a[i]-m);

        }

        sort(c+,c+n+);

        LL ans=;

        RPE(i,n) ans+=abs(c[i]-c[n/]);

        cout<<ans<<endl;

    }

    return ;

}