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

constexpr int kN = int(2E4 + 10);
constexpr int kC = 1 << 10;

int a[kN];
bool now[kN][kC], dp[kN][kC];

int main() {
	int n, ans = 1;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	
	now[0][1] = true;
	for (int i = 1; i <= n; i++) {
		if (a[i] == 0) {
			while (i++ <= n) printf("1\n");
			break;
		}
		for (int j = 0; j < kC; j++) if (now[i - 1][j]) dp[i][j & a[i]] = true;
		for (int j = 0; j < kC; j++) if (dp[i][j]) ans++;
		if (now[i - 1][1] && dp[i][a[i]]) ans--;
		if (dp[i - 1][0]) ans--;
		for (int j = 0; j < kC; j++) if (now[i - 1][j]) now[i][(j * a[i]) & (kC - 1)] = true;
		for (int j = 0; j < kC; j++) if (dp[i][j]) now[i][j] = true;
		printf("%d\n", ans);
	}
}