#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 235813,a[1000005];
ll fact[1000005],factInv[1000005];
int n;

ll mpow(ll x,ll M) {
    if(!M) return 1;
    ll tmp = mpow(x,M/2);
    if(M % 2) return tmp*tmp%mod*x%mod;
    return tmp*tmp%mod;
}

ll Com(ll x,ll r) {
    return fact[x]*factInv[r]%mod*factInv[x-r]%mod;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie();
    cin >> n;
    
    fact[0] = 1;
    for(int i = 1;i <= n;i++) fact[i] = fact[i-1]*i%mod;
    for(int i = 0;i <= n;i++) factInv[i] = mpow(fact[i],mod-2);
    
    for(int i = 1;i <= n;i++) {
        cin >> a[i];
        
    }
    int op = n%2;
    ll val = 0;
    for(int i = 1;i <= n;i++) {
        val = (val+a[i]*Com(n-1,i-1)*(op ? 1 : -1)%mod);
        val %= mod;
        op ^= 1;
    }
    op = n%2;
    int ans = 0;
    for(int i = 1;i <= n;i++) {
        ll t = Com(n-1,i-1)*(op ? 1 : -1);
        ll val2 = val-t*a[i]%mod;
        val2 %= mod;
        val2 += mod;
        val2 %= mod;
        ll v = mpow((-t+mod)%mod,mod-2)*val2%mod; // v = x
        //cout << val2-mod << ' ' << t << '\n';
        //cout << v << ' ' << v*mpow((-t+mod)%mod,mod-2)%mod-mod << ' ';
        //cout << (val2+v*t)%mod << "\n\n";
        if(v > abs(v-mod)) v -= mod;
        if(-100000 <= v&&v <= 100000) ans++;
        
        op ^= 1;
        
    }
    cout << ans;
}

// ax = b (a = Com(n-1,i-1), b = val2)