#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 2, oo = 1e9, M = 1e6;
long long const OO = 1e18;
double const eps = 1e-6, PI = acos(-1);
int mod = oo + 7;
int n, an[N];
pair<pair<int, int>, int> seg[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> seg[i].first.first >> seg[i].first.second;
      seg[i].second = i;
      an[i] = 0;
    }
    sort(seg, seg + n);
    int r = seg[0].first.second;
    int i = 1;
    for (; i < n; i++)
      if (seg[i].first.first > r)
        break;
      else
        r = max(r, seg[i].first.second);
    if (i == n) {
      cout << -1 << '\n';
      continue;
    }
    for (int j = 0; j < i; j++) an[seg[j].second] = 1;
    for (int j = i; j < n; j++) an[seg[j].second] = 2;
    bool y = 0;
    for (int i = 0; i < n - 1; i++)
      if (an[i] != an[i + 1]) y = 1;
    if (y)
      for (int i = 0; i < n; i++) cout << an[i] << ' ';
    else
      cout << -1;
    cout << '\n';
  }
  return 0;
}
