均分纸牌

#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
int n,avr,cnt;
int a[10005];
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        avr+=a[i];
    }
    avr/=n;
    for(int i=1;i<n;i++)
    {
        if(a[i]==avr)continue;
        if(a[i]<avr)
        {
            a[i+1]-=(avr-a[i]);
            a[i]=avr;
            cnt++;
        }
           if(a[i]>avr)
        {
            a[i+1]+=(a[i]-avr);
            a[i]=avr;
            cnt++;
        }
    }
    cout<<cnt;



    return 0;
}