#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e5 + 5, M = 235813, MAX = 1e5;

int fact[N];

int add(int a, int b) {
    a = (a + M) % M;
    b = (b + M) % M;

    return (a + b) % M;
}

int mul(int a, int b) {
    a = (a + M) % M;
    b = (b + M) % M;

    return 1LL * a * b % M;
}

int modPow(int b, int p) {
    if (p == 0)
        return 1;

    int x = modPow(b, p / 2);

    return p % 2 == 0 ? mul(x, x) : mul(b, mul(x, x));
}

int modInvFer(int n) {
    return modPow(n, M - 2);
}

int ncr(int n, int r) {
    return mul(fact[n], mul(modInvFer(fact[r]), modInvFer(fact[n - r])));
}

void pre() {
    fact[0] = 1;

    for (int i = 1; i < N; i++)
        fact[i] = mul(fact[i - 1], i);
}

void testCase() {
    pre();

    int n;
    cin >> n;

    int sign = (n & 1 ? 1 : -1);

    int sum = 0, a[n];
    for (int i = 0; i < n; i++)
        cin >> a[i], sum = add(sum, mul(a[i], sign * ncr(n - 1, i))), sign *= -1;

    sign = (n & 1 ? 1 : -1);

    int cnt = 0;
    for (int i = 0; i < n; i++) {
        sum = add(sum, -mul(a[i], sign * ncr(n - 1, i)));

        int d = M - sum;
        int x = mul(d, modInvFer(sign * ncr(n - 1, i)));
        int y = mul(-sum, modInvFer(sign * ncr(n - 1, i))) - M;

        cnt += x <= MAX && x != a[i] || -y <= MAX && -y != a[i];

        sum = add(sum, mul(a[i], sign * ncr(n - 1, i)));

        sign *= -1;
    }

    cout << cnt;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}