#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
const int maxn=100;
int n,a[maxn],zong,avga,ans=0,x,y;
priority_queue<int>b;
priority_queue<int>c;
int main()
{
	freopen("jfzp.in","r",stdin);
	freopen("jfzp.out","w",stdout);
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
	  scanf("%d",&a[i]);
	  zong+=a[i];
	}
	avga=zong/n;
	for(int i=0;i<n;i++)
	{
	  if(a[i]-avga<0)b.push(avga-a[i]);
	  if(a[i]-avga>0)c.push(a[i]-avga);
	}
	for(;;)
	{
	  x=c.top();c.pop();
	  y=b.top();b.pop();
	  if(x>y)c.push(x-y);
	  if(x<y)b.push(y-x);
	  ans++;
	  if(c.empty())break;
	}
	printf("%d",ans);
	return 0;
}