#include <iostream>
#include <numeric>
using LL = long long;
constexpr int N = 1E5;
constexpr int mod = 235813;
constexpr int R = 1E5;
int fac[N], inv_fac[N];
int A[N];
int mul(int a, int b) { return static_cast<LL>(a) * b % mod; }
int mul(int a, int b, int c) { return mul(mul(a, b), c); }
int pow(int b, int e)
{
	int r = 1;
	while (e)
	{
		if (e & 1) r = mul(r, b);
		e >>= 1, b = mul(b, b);
	}
	return r;
}
int inv(int a) { return pow(a, mod - 2); }
int C(int n, int m) { return mul(fac[n], inv_fac[n - m], inv_fac[m]); }
int main()
{
	fac[0] = 1;
	for (int i = 1; i < N; ++i)
		fac[i] = mul(fac[i - 1], i);
	inv_fac[N - 1] = inv(fac[N - 1]);
	for (int i = N; --i; )
		inv_fac[i - 1] = mul(inv_fac[i], i);
	std::ios_base::sync_with_stdio(false), std::cin.tie(nullptr);
	int N; std::cin >> N;
	for (int i = 0; i < N; ++i)
		std::cin >> A[i];
	int sgn = 1, base = 0;
	for (int i = N; ~--i; sgn = -sgn)
		(base += sgn * mul(C(N - 1, i), A[i])) %= mod;
	base = (base + mod) % mod;
	// std::cerr << base << std::endl;
	int ans = 0;
	for (int i = N; ~--i; )
	{
		base = base ? mod - base : 0;
		// C(N - 1, i) * delta[i] = base
		int a = C(N - 1, i);
		if (a == 0)
		{
			if (base == 0)
				++ans;
		}
		else
		{
			int d = mul(inv(a), base);
			d += A[i];
			while (d >= -R)
				d -= mod;
			d += mod;
			while (d <= R)
			{
				if (d != A[i])
				{
					++ans;
					break;
				}
				d += R;
			}
		}
	}
	std::cout << ans << "\n";
}