#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int L=10;
const int MASK=(1<<L)-1;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<int> A(N);
  rep(i,N) cin>>A[i];

  vector<ll> sum(N+1,0);
  rep(i,N) sum[i+1]=sum[i]+A[i];

  vector<vector<vector<int>>> dp(N+1,vector<vector<int>> (1<<L,vector<int> (2,0)));
  dp[0][0][0]=1;
  ll num=0;
  for(int i=0;i<N;i++){
      for(int j=0;j<(1<<L);j++){
          for(int k=0;k<2;k++){
              if(dp[i][j][k]==0) continue;
              dp[i+1][j&A[i]][0]=1;
              if(j+A[i]<(1<<L)) dp[i+1][j+A[i]][k]=1;
              else{
                  dp[i+1][(j+A[i])&MASK][1]=1;
                  if(k==0) num++;
              }
          }
      }

      ll res=0;
      rep(j,(1<<L)) if(dp[i+1][j][0]) res++;
      res+=num;
      cout<<res<<"\n";
  }
  
  return 0;
}