#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;

ll n, sum;
ll y[1000005];
int main(void){
    cin >> n;
    sum = 0;
    for (int i = 0; i < n; i++){
        cin >> y[i];
        sum += y[i];
    }

    ll L1, L2, y1, y2;
    L1 = L2 = 0;

    y1 = sum / n; y2 = sum / n + 1;

    for (int i = 0; i < n; i++){
        L1 += abs(y[i] - y1);
        L2 += abs(y[i] - y2);
    }

    if (L1 < L2) cout << L1 << endl;
    else  cout << L2 << endl;

}