#include <bits/stdc++.h>
using namespace std;
template <typename T>
void dbg_vector(const T& v) {
  for (size_t i = 0; i < v.size(); ++i) cout << v[i] << " ";
  cout << endl;
}
void dbg() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg(Head H, Tail... T) {
  cerr << H << ' ';
  dbg(T...);
}
struct pair_hash {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2>& p) const {
    auto h1 = std::hash<T1>{}(p.first);
    auto h2 = std::hash<T2>{}(p.second);
    return h1 ^ h2;
  }
};
inline long long lmin(long long a, long long b) {
  if (a < b) return a;
  return b;
}
inline long long lmax(long long a, long long b) {
  if (a > b) return a;
  return b;
}
inline long long labs(long long a) {
  if (a < 0) return -a;
  return a;
}
const long long INF = 1e18;
const long long P_HASH = 31;
const long long MOD = 1e9 + 7;
const long double EPS = 1e-8;
const long double PI = atan(1) * 4;
struct e {
  int f, s, t;
  e(){};
  e(int f, int s, int t) : f(f), s(s), t(t){};
};
bool cmp(const e& a, const e& b) {
  if (a.f < b.f) return true;
  if (a.f > b.f) return false;
  if (a.s < b.s) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<e> ev;
    for (int i = 0; i <= n - 1; ++i) {
      int l, r;
      cin >> l >> r;
      ev.push_back(e(l, 1, i));
      ev.push_back(e(r, 2, i));
    }
    sort(ev.begin(), ev.end(), cmp);
    int g = 1;
    int cur = 0;
    vector<int> group(n);
    for (int i = 0; i <= 2 * n - 1; ++i) {
      if (ev[i].s == 1) {
        if (cur == 0) {
          g = 1 - g;
        }
        group[ev[i].t] = g;
        cur++;
      } else {
        cur--;
      }
    }
    bool was_0 = false, was_1 = false;
    for (int i = 0; i <= n - 1; ++i)
      if (group[i] == 0) {
        was_0 = true;
      } else
        was_1 = true;
    if (!was_0 || !was_1) {
      cout << -1 << endl;
      continue;
    }
    for (int i = 0; i <= n - 1; ++i) cout << (group[i] + 1) << ' ';
    cout << '\n';
  }
}
