#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int N;
int A[20000];
int dp[1024];
int nx[1024];
int up;
int main(){
  int k;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  dp[0] = 1;
  for(k=(0);k<(N);k++){
    int i;
    for(i=(0);i<(1024);i++){
      nx[i] = 0;
    }
    for(i=(0);i<(1024);i++){
      if(dp[i]){
        nx[i&A[k]] = 1;
        if(i+A[k] < 1024){
          nx[i+A[k]] = 1;
        }
        else{
          up++;
        }
      }
    }
    for(i=(0);i<(1024);i++){
      dp[i] = nx[i];
    }
    int ao_dF3pO;
    int tU__gIr_;
    if(1024==0){
      tU__gIr_ = 0;
    }
    else{
      tU__gIr_ = dp[0];
      for(ao_dF3pO=(1);ao_dF3pO<(1024);ao_dF3pO++){
        tU__gIr_ += dp[ao_dF3pO];
      }
    }
    wt_L(up +tU__gIr_);
    wt_L('\n');
  }
  return 0;
}
// cLay version 20210321-1 [beta]

// --- original code ---
// int N, A[2d4];
// int dp[1024], nx[1024], up;
// {
//   rd(N,A(N));
//   dp[0] = 1;
//   rep(k,N){
//     rep(i,1024) nx[i] = 0;
//     rep(i,1024) if(dp[i]) {
//       nx[i&A[k]] = 1;
//       if(i+A[k] < 1024) nx[i+A[k]] = 1;
//       else up++;
//     }
//     rep(i,1024) dp[i] = nx[i];
//     wt(up + sum(dp(1024)));
//   }
// }