Problem: Little Petya likes numbers a lot. Recently his mother has presented him a collection of n non-negative integers. There's only one thing Petya likes more than numbers: playing with little Masha. He immediately decided to give a part of his new collection to her. To make the game even more interesting, Petya decided to give Masha such collection of numbers for which the following conditions fulfill:

  * Let's introduce x1 to denote the xor of all numbers Petya has got left; and let's introduce x2 to denote the xor of all numbers he gave to Masha. Value (x1 + x2) must be as large as possible. 
  * If there are multiple ways to divide the collection so that the previous condition fulfilled, then Petya minimizes the value x1. 



The xor operation is a bitwise excluding "OR", that is denoted as "xor" in the Pascal language and "^" in C/C++/Java.

Help Petya divide the collection as described above. If there are multiple suitable ways to divide it, find any of them. Please note that after Petya gives a part of his numbers to Masha, he may have no numbers left. The reverse situation is also possible, when Petya gives nothing to Masha. In both cases we must assume that the xor of an empty set of numbers equals 0.

Input

The first line contains integer n (1 ≤ n ≤ 105), showing how many numbers Petya's mother gave him. The second line contains the actual space-separated numbers. They are all integer, non-negative and do not exceed 1018.

Output

Print n space-separated integers, the i-th of them should equal either 1, if Petya keeps the number that follows i-th in his collection, or it should equal 2, if Petya gives the corresponding number to Masha. The numbers are indexed in the order in which they are given in the input.

Examples

Input

6
1 2 3 4 5 6


Output

2 2 2 2 2 2


Input

3
1000000000000 1000000000000 1000000000000


Output

2 2 2


Input

8
1 1 2 2 3 3 4 4


Output

1 2 1 2 2 2 1 2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long LINF = 2e16;
const int INF = 1e9;
const int magic = 348;
const double eps = 1e-10;
const double pi = 3.14159265;
inline int getint() {
  char ch;
  int res;
  bool f;
  while (!isdigit(ch = getchar()) && ch != '-') {
  }
  if (ch == '-')
    f = false, res = 0;
  else
    f = true, res = ch - '0';
  while (isdigit(ch = getchar())) res = res * 10 + ch - '0';
  return f ? res : -res;
}
inline long long getLL() {
  char ch;
  long long res;
  bool f;
  while (!isdigit(ch = getchar()) && ch != '-') {
  }
  if (ch == '-')
    f = false, res = 0;
  else
    f = true, res = ch - '0';
  while (isdigit(ch = getchar())) res = res * 10 + ch - '0';
  return f ? res : -res;
}
struct equation {
  bitset<100048> b;
  int res;
  inline void init() {
    b = 0;
    res = 0;
  }
} cur;
map<int, equation> b;
bool exist[100048];
int n;
long long a[100048];
int maxbit;
int ans[148];
int sol[100048];
inline bool check() {
  int bit, i;
  for (i = 1; i <= n; i++)
    if (cur.b[i])
      if (exist[i])
        cur.b ^= b[i].b, cur.res ^= b[i].res;
      else {
        b[i] = cur;
        exist[i] = true;
        return true;
      }
  if (cur.res)
    return false;
  else
    return true;
}
inline void find_solution() {
  int i, j;
  for (i = n; i >= 1; i--) {
    if (!exist[i]) {
      sol[i] = 0;
      continue;
    }
    for (j = i + 1; j <= n; j++)
      if (b[i].b[j]) b[i].res ^= sol[j];
    sol[i] = b[i].res;
  }
}
int main() {
  int i, bit;
  n = getint();
  for (i = 1; i <= n; i++) a[i] = getLL();
  for (maxbit = 63; maxbit; maxbit--) {
    bool f = false;
    for (i = 1; i <= n; i++)
      if (a[i] & (1ll << (maxbit - 1))) {
        f = true;
        break;
      }
    if (f) break;
  }
  for (bit = maxbit; bit; bit--) {
    cur.init();
    for (i = 1; i <= n; i++)
      if (a[i] & (1ll << (bit - 1))) cur.b[i] = 1, cur.res++;
    if (cur.res % 2 == 1) {
      ans[bit] = 1;
      continue;
    }
    cur.res = 1;
    if (check())
      ans[bit] = 2;
    else
      ans[bit] = 0;
  }
  for (bit = maxbit; bit; bit--)
    if (ans[bit] == 1) {
      cur.init();
      for (i = 1; i <= n; i++)
        if (a[i] & (1ll << (bit - 1))) cur.b[i] = 1;
      cur.res = 0;
      check();
    }
  find_solution();
  for (i = 1; i <= n; i++) printf("%d ", 2 - sol[i]);
  return 0;
}