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

typedef long long ll;

const int MOD = 235813;
const int MAXN = 101010;

ll _pow(ll a, ll x) {
    ll r = 1;
    while (x) {
        if (x & 1) r = r * a % MOD;
        a = a * a % MOD;
        x /= 2;
    }
    return r;
}
int n, a[MAXN];
ll fac[MAXN], inv[MAXN];

ll binom(int n, int r) {
    return fac[n] * inv[n - r] % MOD * inv[r] % MOD;
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    fac[0] = 1;
    for (int i = 1; i < MAXN; i++) fac[i] = fac[i - 1] * i % MOD;
    inv[MAXN - 1] = _pow(fac[MAXN - 1], MOD - 2);
    for (int i = MAXN - 1; i > 0; i--) inv[i - 1] = inv[i] * i % MOD;
    ll s = 0;
    for (int i = 1; i <= n; i++) {
        ll coeff = binom(n - 1, n - i);
        if ((n - i) % 2 == 1) coeff = (MOD - coeff) % MOD;
        s = (s + (a[i] + MOD) % MOD * coeff % MOD) % MOD;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ll coeff = binom(n - 1, n - i);
        if ((n - i) % 2 == 1) coeff = (MOD - coeff) % MOD;

        ll x = (MOD - s) % MOD * _pow(coeff, MOD - 2) % MOD;
        if (x == 0) continue;
        if (a[i] + x >= -100'000 && a[i] + x <= 100'000)
            ++ans;
        else {
            x = (MOD - x) % MOD;
            if (a[i] + x >= -100'000 && a[i] + x <= 100'000)
                ++ans;
        }
    }
    cout << ans << '\n';
}