#include<bits/stdc++.h>
using namespace std;
int n,a[120],sum;
bool cmp(int a,int b){
	return a>b;
}
int l,r;int mubiao,k,ans;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum+=a[i];
	}int z = 0;
	l=1,r=n;
	mubiao = sum/n;
	sort(a+1,a+1+n,cmp);
	if(n%2==0){
	while(l<=r){
		if(a[l]!=mubiao){
			ans++;
			k = mubiao - a[l];
			a[r] = a[r] - k;
			a[l] = mubiao;
			l++;
			if(a[r] == mubiao){
				r--;
			}
			else{
				continue;
			}
		}
	}
}
else{
	while(l<r){
		if(a[l]!=mubiao){
			ans++;
			k = mubiao - a[l];
			a[r] = a[r] - k;
			a[l] = mubiao;
			l++;
			if(a[r] == mubiao){
				r--;
			}
			else{
				continue;
			}
		}
	}
}

	cout<<ans;
	return 0;
}