#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int N = 200005;
ll MOD = 235813;
ll fact[N], ifact[N];
ll fp(ll x, ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % MOD;
        y >>= 1;
        x = x * x % MOD;
    }
    return res;
}
ll inv(ll x) {
    return fp(x, MOD - 2);
}
void build_fact() {
    fact[1] = 1;
    ifact[1] = 1;
    for(ll i = 2; i < N; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        ifact[i] = inv(fact[i]);
    }
}
ll C(ll a, ll b) {
    return fact[a] * ifact[b] % MOD * ifact[a - b] % MOD;
}
ll arr[N];
int main() {
    cin.tie(0)->sync_with_stdio(false);

    build_fact();

    int n;
    cin >> n;

    ll ori = 0;
    for(ll i = 1; i <= n; i++) {
        cin >> arr[i];

        ll sign;
        if((n - i) % 2 == 0) sign = 1;
        else sign = -1;
        ori += sign * arr[i] * C(n, i); 
        ori = (ori % MOD + MOD) % MOD;
    }
    ll ans = 0;
    for(ll i = 1; i <= n; i++) {
        bool isable = false;
        ll dif_plus = (MOD - ori);
        ll dif_minu = (ori);
        // C * a == dif_plus
        ll tp = dif_plus * inv(C(n, i)) % MOD;
        ll tm = dif_minu * inv(C(n, i)) % MOD;
        // cerr << tp << " " << tm << "\n";
        if(arr[i] + tp <= 100000) {
            isable = true;
        }
        if(arr[i] - tm >= -100000) {
            isable = true;
        }
        ans += isable;
    }
    cout << ans << "\n";
}