#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

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

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

int main() {
	int n, ans = 1;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);

	now[0] = true;
	for (int i = 1; i <= n; i++) {
		cur.reset();
		int rev = kC - 1 - a[i];

		if (now.test(0)) cur[0] = true;
		else {
			for (int k = rev; k > 0; k = (k - 1) & rev) if (now.test(k)) {
				cur[0] = true;
				break;
			}
		}
		for (int j = a[i]; j > 0; j = (j - 1) & a[i]) {
			if (now.test(j)) cur[j] = true;
			else {
				for (int k = rev; k > 0; k = (k - 1) & rev) if (now.test(j | k)) {
					cur[j] = true;
					break;
				}
			}
		}

		ans += cur.count();
		if (now.test(0) && cur.test(a[i])) ans--;
		now = (now << a[i]) | (now >> (kC - a[i])) | cur;
	}
	printf("%d\n", ans);
}