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

constexpr int kN = int(2E4 + 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();
		for (int j = 0; j < kC; j++) if (now.test(j)) cur[j & a[i]] = true;
		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);
	}
}