#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e6+10,mo = 235813;

int a[N];

ll D[N],jc[N],invjc[N];
ll q_pow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1)res=res*a%mo;
        a=a*a%mo;
        b>>=1;
    }
    return res;
}
ll inv(ll a){
    return q_pow(a,mo-2);
}
ll C(ll n,ll m){
    if(m>n||m<0||n<0)return 0;
    ll ans=jc[n];
    ans=ans*invjc[m]%mo;
    ans=ans*invjc[n-m]%mo;
    return ans;
}
void initzhs(){
    D[2]=1;
    for(int i=3;i<N;i++)D[i]=(i-1)*(D[i-1]+D[i-2])%mo;
    D[0]=1;
    jc[0]=1;
    for(int i=1;i<N;i++)jc[i]=jc[i-1]*i%mo;
    for(int i=0;i<N;i++)invjc[i]=inv(jc[i]);
}
int n;
int xs[N];
int pre[N];
bool check(int p){
    int sum = (pre[p-1]+pre[n]-pre[p]+mo)%mo;
    int m;
    if(xs[p]>0)m=mo-sum;
    else m=sum;
    int x=abs(xs[p]);
    if(x==0)return 0;
    int ay=m*inv(x)%mo;
    // cerr<<"ay="<<ay<<"\n";
    if(ay>1e5&&mo-ay>1e5||ay==a[p])return 0;
    return 1;
}
inline void solve(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++){
        xs[i]=C(n-1,i-1);
        if((n+i)%2==1)xs[i]*=-1;
    }
    for(int i=1;i<=n;i++){
        if(xs[i]>0)pre[i]=(pre[i-1]+xs[i]*a[i]%mo)%mo;
        else pre[i]=(pre[i-1]-(-xs[i])*a[i]%mo+mo)%mo;
    }
    int ans=0;
    for(int i=1;i<=n;i++)if(check(i))ans++;
    cout<<ans<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    initzhs();
    int WTN666=1;//cin>>WTN666;
    while(WTN666--){
        solve();
    }
}