#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int nmax=1000086;
typedef long long ll;
int n;
ll ans=0;
ll ave=0,sum=0;
int val[nmax]={0};
ll pre[nmax]={0};
void Clear()
{
	ans=0;
	sum=0;
	ave=0;
	memset(val,0,sizeof(val));
	memset(pre,0,sizeof(pre));
}
int main()
{
	freopen("Wealth.in","r",stdin);
	freopen("Wealth.out","w",stdout);
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&val[i]);
			sum+=val[i];
		}
		ave=sum/n;
		for(int i=1;i<n;i++)
		{
			pre[i]=pre[i-1]+val[i]-ave;
		}
		sort(pre,pre+n);
		int mid=n/2;
		for(int i=0;i<n;i++)
		{
			ans+=abs(pre[mid]-pre[i]);
		}
		printf("%lld\n",ans);
		Clear();	
	}
	return 0;
}