#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const ll MOD = 235813;

int N, A[MAXN+10], B[MAXN+10];

ll mypow(ll x, ll y)
{
	ll ret=1;
	while(y)
	{
		if(y&1) ret=ret*x%MOD;
		y>>=1; x=x*x%MOD;
	}
	return ret;
}

ll inv(ll x) { return mypow(x, MOD-2); }

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++) scanf("%d", &A[i]), A[i]=(A[i]+MOD)%MOD;

	B[N]=1;
	ll sum=0;
	for(int i=N-1; i>=1; i--)
	{
		B[i]=B[i+1]*(MOD-1)%MOD*i%MOD*inv(N-i)%MOD;
	}

	for(int i=1; i<=N; i++) sum=(sum+B[i]*A[i])%MOD;

	int ans=0;
	for(int i=1; i<=N; i++)
	{
		ll t=((A[i]*B[i]-sum)%MOD+MOD)%MOD;
		ll v=t*inv(B[i])%MOD;
		ll x=100000;
		if(v>x) v-=MOD;
		if(-x<=v && v<=x && v!=A[i]) ans++;
	}
	printf("%d\n", ans);
}