// Compile flags -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -fmax-errors=2
#include <bits/stdc++.h>
using namespace std;

constexpr int kN = int(5E3 + 10);
constexpr int kC = 1 << 10;

int a[kN], cnt[kN];
bitset<kC> dp[kN], now;

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	
	now[0] = true;
	cnt[0] = 1;
	for (int i = 1; i <= n; i++) {
		//for (int j = 0; j < kC; j++) if (dp[i - 1][j]) dp[i][(j + a[i]) & 1023] = true;
		for (int j = 0; j < kC; j++) if (now.test(j)) dp[i][j & a[i]] = true;
		cnt[i] = cnt[i - 1] + dp[i].count();
		if (now.test(0) && dp[i].test(a[i])) cnt[i]--;
		//printf("cnt[%d] = %d\n", i, cnt[i]);
		//for (int j = 0; j < kC; j++) printf("%d", now[j] ? 1 : 0);
		//printf("\n");
		//for (int j = 0; j < kC; j++) printf("%d", dp[i][j] ? 1 : 0);
		//printf("\n");
		now = (now << a[i]) | (now >> (kC - a[i])) | dp[i];
	}
	printf("%d\n", cnt[n]);

	// X & A + B -> ge B
	// X + A & B -> le B
	// dp[i][j] : lst and at i, possible values
}