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

#ifdef DEBUG
#define fast
#else
#define fast cin.tie(0)->sync_with_stdio(0)
#define cerr if(1);else cerr
#define endl '\n'
#endif
#define _ <<' '<<
#define ALL(v) v.begin(),v.end()
#define ft first
#define sd second

using ll = long long;
using ld = long double;
using pii = pair<int,int>;

constexpr ll MOD = 235'813;
constexpr int MAXN = 1e5;

ll fpow(ll a, ll b) {
    ll r = 1;
    while (b) {
        if (b & 1) r = r * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return r;
}

ll inverse(ll x) {
    return fpow(x, MOD-2);
}

ll fac[MAXN+1], infac[MAXN+1];
ll C(int n, int m) {
    return fac[n] * infac[m] % MOD * infac[n-m] % MOD;
}

signed main() {
    fast;

    fac[0] = 1;
    for (int i = 1; i <= MAXN; i++)
        fac[i] = fac[i-1] * i % MOD;
    infac[MAXN] = inverse(fac[MAXN]);
    for (int i = MAXN; i > 0; i--)
        infac[i-1] = infac[i] * i % MOD;

    int n;
    cin >> n;
    vector<int> A(n);
    for (auto &x: A) cin >> x;

    ll sum = 0;
    for (int i = n-1, j = 1; i >= 0; i--, j *= -1) {
        ll t = C(n-1, i) * j + (j < 0 ? MOD : 0);
        cerr _ i _ A[i] _ t _ endl;
        sum = (sum + t * A[i]) % MOD;
    }
    cerr _ sum _ endl;

    int c = 0;
    for (int i = n-1, j = 1; i >= 0; i--, j *= -1) {
        ll t = C(n-1, i) * j + (j < 0 ? MOD : 0);
        ll x = sum * inverse(t) % MOD;
        ll y = (A[i] + x) % MOD;
        if (y < 0) y += MOD;
        if (y > MAXN) y -= MOD;
        cerr _ i _ A[i] _ '/' _ x _ y _ endl;
        if (-MAXN <= y and y < MAXN and x != 0)
            c++;
    }
    cout << c << endl;

    return 0;
}