#include <iostream>

using namespace std;


int main()
{
    int n, A[100000], id, before, after,difa, difb, answer = 0;
    long long BEF[100001], total = 0;
    bool sorted = false;
    cin >> n;
    BEF[0] = 0;
    for(int i = 0; i < n; i++)
    {
        cin >> A[i];
        total+=A[i];
        BEF[i + 1] = total;
    }
    id = total / n;
    while(!sorted)
    {
        sorted = true;
        for(int i = 0; i < n; i++)
        {
            if(A[i] > id)
            {
                sorted = false;
                before = BEF[i];
                after = total - BEF[i] - A[i];
                difb = id * i - before;
                difa = id * (n - i - 1) - after;
                if(difa > 0)
                {
                    A[i]-=difa;
                    A[i+1]+=difa;
                    BEF[i+1]-=difa;
                    answer++;
                }
                if(difb > 0)
                {
                    A[i]-= difb;
                    A[i-1]+= difb;
                    BEF[i]+=difb;
                    answer++;
                }
            }
        }
    }
    cout << answer;
    return 0;
}