#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 7;
const long long linf = 1ll << 60;
const double dinf = 1e60;
template <typename T>
inline void scf(T &x) {
  bool f = 0;
  x = 0;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') {
    f = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  if (f) x = -x;
  return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) {
  scf(x);
  return scf(y);
}
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) {
  scf(x);
  scf(y);
  return scf(z);
}
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
  scf(x);
  scf(y);
  scf(z);
  return scf(w);
}
inline char mygetchar() {
  char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
template <typename T>
void chkmax(T &x, const T &y) {
  if (y > x) x = y;
  return;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
  return;
}
const int N = 2e5 + 100;
int n;
int ans[N], id[N], x[N];
vector<int> g[N];
void TZL() {
  scf(n);
  for (int i = (1); i <= (n); ++i) {
    scf(x[i], x[i + n]);
    x[i + n]++;
    g[i].push_back(i + n);
    g[i + n].push_back(i);
    id[i] = i;
    id[i + n] = i + n;
  }
  sort(id + 1, id + n + n + 1, [&](int i, int j) { return x[i] < x[j]; });
  for (int i = 1; i <= n + n; i += 2) {
    g[id[i]].push_back(id[i + 1]);
    g[id[i + 1]].push_back(id[i]);
  }
  return;
}
void dfs(int u, int c = 1) {
  ans[u] = c;
  for (int v : g[u])
    if (!ans[v]) dfs(v, 3 - c);
  return;
}
void RANK1() {
  for (int i = (1); i <= (n); ++i) {
    if (!ans[i]) dfs(i);
    printf("%d ", ans[i] - 1);
  }
  return;
}
int main() {
  TZL();
  RANK1();
  return 0;
}
