#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}



void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M=1024;
	cin>>N;
	vector<bool> dp1(M);
	vector<int> dp2(M);
	dp1[0]=1;
	rep(roop,N){
		int a;
		cin>>a;
		vector<bool> n_dp1(M);
		vector<int> n_dp2(M);
		rep(i,M){
			if(dp1[i]){
				if(i+a>=M) n_dp2[i+a-M]++;
				else n_dp1[i+a]=1;
				n_dp1[i&a]=1;
			}if(dp2[i]!=0){
				n_dp2[(i+a)%M]+=dp2[i];
				n_dp1[i&a]=1;
			}
		}
		int ans=0;
		rep(i,M){
			if(n_dp1[i]) ans++;
			ans+=n_dp2[i];
		}
		swap(dp1,n_dp1);
		swap(dp2,n_dp2);
		cout<<ans<<"\n";
	}
}