#include <bits/stdc++.h>
using namespace std;
const int N=100100;
int a[N],n,i,ans,sum;
int main()
{
cin>>n;
for (i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
int sm=a[n/2+1];
for (i=1;i<=n;i++)
ans=ans+abs(a[i]-sm);
cout<<ans;
return 0;
}
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1000010;
int n;
int a[N];
LL c[N];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
LL sum = 0;
for (int i = 1; i <= n; i ++ ) sum += a[i];
LL avg = sum / n;
for (int i = n; i > 1; i -- )
{
c[i] = c[i + 1] + avg - a[i];
}
c[1] = 0;
sort(c + 1, c + n + 1);
LL res = 0;
for (int i = 1; i <= n; i ++ ) res += abs(c[i] - c[(n + 1) / 2]);//中位数mid=c[(n+1)/2]
printf("%lld\n", res);
return 0;
}