#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100050;
bitset<Maxn> equ[70];
long long x[Maxn];
int n, tot, b[70], res[Maxn], l[70], ans[Maxn];
bool check() {
  while (true) {
    int left = 0, flag = 0;
    for (; left <= n; ++left)
      if (equ[tot][left]) break;
    if (left == n + 1 && b[tot])
      return false;
    else if (left == n + 1)
      return true;
    for (int i = 1; i < tot; ++i)
      if (l[i] == left) {
        equ[tot] ^= equ[i], b[tot] ^= b[i];
        flag = 1;
        break;
      }
    l[tot] = left;
    if (!flag) return true;
  }
}
void Gauss() {
  int tp = 1;
  for (int i = 1; i <= n; ++i) {
    int k = tp;
    for (; k <= tot; ++k)
      if (equ[k][i]) break;
    if (k == tot + 1) continue;
    if (k != tp) swap(equ[k], equ[tp]), swap(b[k], b[tp]);
    for (int j = tp + 1; j <= tot; ++j)
      if (equ[j][i]) {
        equ[j] ^= equ[tp];
        b[j] ^= b[tp];
      }
    l[tp] = i;
    tp++;
  }
  int last = n;
  for (int i = tp - 1; i; --i) {
    for (int j = n; j > l[i]; --j) b[i] ^= equ[i][j] * res[j];
    res[l[i]] = b[i];
  }
}
int main() {
  long long T = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lld", &x[i]), T ^= x[i];
  for (int i = 60; i >= 0; --i)
    if (!(T & 1LL << i)) {
      ++tot;
      equ[tot].reset();
      for (int j = 1; j <= n; ++j)
        if (x[j] & 1LL << i) equ[tot][j] = 1;
      b[tot] = 1;
      if (check())
        ans[i] = 1;
      else {
        ans[i] = 0;
        tot--;
      }
    }
  for (int i = 60; i >= 0; --i)
    if (T & 1LL << i) {
      ++tot;
      equ[tot].reset();
      for (int j = 1; j <= n; ++j)
        if (x[j] & 1LL << i) equ[tot][j] = 1;
      b[tot] = 0;
      if (check())
        ans[i] = 0;
      else {
        ans[i] = 1;
        tot--;
      }
    }
  tot = 0;
  for (int i = 60; i >= 0; --i) {
    ++tot;
    equ[tot].reset();
    for (int j = 1; j <= n; ++j)
      if (x[j] & 1LL << i) equ[tot][j] = 1;
    b[tot] = ans[i];
  }
  Gauss();
  for (int i = 1; i <= n; ++i) printf("%d ", res[i] == 1 ? 1 : 2);
  puts("");
  return 0;
}
