Problem: Iahub isn't well prepared on geometry problems, but he heard that this year there will be a lot of geometry problems on the IOI selection camp. Scared, Iahub locked himself in the basement and started thinking of new problems of this kind. One of them is the following.

Iahub wants to draw n distinct segments [li, ri] on the OX axis. He can draw each segment with either red or blue. The drawing is good if and only if the following requirement is met: for each point x of the OX axis consider all the segments that contains point x; suppose, that rx red segments and bx blue segments contain point x; for each point x inequality |rx - bx| ≤ 1 must be satisfied.

A segment [l, r] contains a point x if and only if l ≤ x ≤ r.

Iahub gives you the starting and ending points of all the segments. You have to find any good drawing for him.

Input

The first line of input contains integer n (1 ≤ n ≤ 105) — the number of segments. The i-th of the next n lines contains two integers li and ri (0 ≤ li ≤ ri ≤ 109) — the borders of the i-th segment.

It's guaranteed that all the segments are distinct.

Output

If there is no good drawing for a given test, output a single integer -1. Otherwise output n integers; each integer must be 0 or 1. The i-th number denotes the color of the i-th segment (0 is red and 1 is blue).

If there are multiple good drawings you can output any of them.

Examples

Input

2
0 2
2 3


Output

0 1


Input

6
1 5
1 3
3 5
2 10
11 11
12 12


Output

0 1 0 1 0 0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
int P[2 * 110000], X[110000], Y[110000], use[2 * 110000], n, tot,
    vis[2 * 110000], du[2 * 110000];
vector<pair<int, int> > E[2 * 110000];
void dfs(int x) {
  vis[x] = 1;
  for (auto i : E[x])
    if (!use[i.second]) {
      if (i.first > x)
        use[i.second] = 1;
      else
        use[i.second] = -1;
      dfs(i.first);
    }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &X[i], &Y[i]);
    P[++tot] = X[i];
    P[++tot] = Y[i] + 1;
  }
  sort(P + 1, P + tot + 1);
  tot = unique(P + 1, P + tot + 1) - P - 1;
  for (int i = 1; i <= n; ++i) {
    auto Find = [](int x) { return lower_bound(P + 1, P + tot + 1, x) - P; };
    int l = Find(X[i]), r = Find(Y[i] + 1);
    E[l].push_back(make_pair(r, i));
    E[r].push_back(make_pair(l, i));
    du[l]++;
    du[r]++;
  }
  int cnt = n, last = 0;
  for (int i = 1; i <= tot; ++i)
    if (du[i] & 1) {
      if (last)
        E[last].push_back(make_pair(i, ++cnt)),
            E[i].push_back(make_pair(last, cnt)), last = 0;
      else
        last = i;
    }
  for (int i = 1; i <= tot; ++i)
    if (!vis[i]) dfs(i);
  for (int i = 1; i <= n; ++i) printf("%d ", max(use[i], 0));
}