#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
const int lim = 1 << 10;
bool dp[20004][2][lim];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin >> N;
	vector<int>A(N);
	rep(i, N) { cin >> A[i]; }
	vector<int>S(N + 1);//後ろからの累積和
	rrep(i, N) { S[i] = A[i] + S[i + 1]; }
	vector<bool>table(lim*N + 1);
	table[S[0]] = true;
	int ans = 1;
	dp[0][1][0] = true;
	rep(i, N) {
		rep(j, lim) {
			if ((!dp[i][0][j]) && (!dp[i][1][j])) { continue; }
			dp[i + 1][0][(j + A[i]) % lim] = true;
			dp[i + 1][1][j&A[i]] = true;
		}
		rep(j, lim) {
			if (dp[i + 1][1][j] && !table[j + S[i + 1]]) {
				table[j + S[i + 1]] = true;
				ans++;
			}
		}
		cout << ans << endl;
	}
	return 0;
}