#include <cstdio> #include <algorithm> using namespace std; typedef long long LL; const int N=1000010; LL n,a[N],t,tmp[N],k,ans; void read(LL &x){char c;while((c=getchar())<'0'||c>'9');x=c-'0';while((c=getchar())>='0'&&c<='9') x=x*10+c-'0';} int main(){ //freopen("1045.in","r",stdin);freopen("1045.out","w",stdout); scanf("%lld",&n); for(int i=1;i<=n;i++) scanf("%lld",&a[i]),a[i]+=a[i-1]; t=a[n]/n; tmp[n]=0; for(int i=1;i<n;i++) tmp[i]=i*t-a[n]+a[n-i]; std::sort(tmp+1,tmp+n+1); k=tmp[(n+1)>>1]; for(int i=1;i<=n;i++) ans+=abs(k-tmp[i]); printf("%lld",ans); return 0; }