#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  int p = N;
  for (int i = 0; i < N; i++){
    if (A[i] == 0){
      p = i;
      break;
    }
  }
  vector<vector<bool>> dp(N + 1, vector<bool>(1 << 10, false));
  dp[0][1] = true;
  for (int i = 0; i < N; i++){
    for (int j = 0; j < (1 << 10); j++){
      if (dp[i][j]){
        dp[i + 1][(j * A[i]) % (1 << 10)] = true;
        dp[i + 1][j & A[i]] = true;
      }
    }
  }

  vector<bool> used(1024, false);
  used[1] = true;
  int ans = 1;
  for (int i = 0; i < p; i++){
    vector<bool> used2(1024, false);
    for (int j = 0; j < 1024; j++){
      if (j * A[i] < 1024){
        used2[j * A[i]] = used[j];
      }
    }
    swap(used, used2);
    for (int j = 0; j < (1 << 10); j++){
      if (dp[i][j]){
        int x = j & A[i];
        if (!used[x]){
          used[x] = true;
          ans++;
        }
      }
    }
    cout << ans << endl;
  }
  for (int i = p; i < N; i++){
    cout << 1 << endl;
  }
}