#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int t, n, l, r, mn[N];
vector<pair<pair<int, int>, int> > v;
vector<pair<int, int> > ans;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  while (t--) {
    v.clear();
    ans.clear();
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> l >> r;
      v.push_back({{l, r}, i});
    }
    for (int i = 0; i < n; i++) mn[i] = 1e9;
    sort(v.begin(), v.end(),
         [&](pair<pair<int, int>, int> p1, pair<pair<int, int>, int> p2) {
           if (p1.first.second != p2.first.second)
             return p1.first.second < p2.first.second;
           return p1.first.first < p2.first.first;
         });
    mn[n - 1] = v.back().first.first;
    for (int i = n - 2; i >= 0; i--) mn[i] = min(mn[i + 1], v[i].first.first);
    int last = -1;
    for (int i = 0; i < n - 1; i++) {
      if (v[i].first.second < mn[i + 1]) {
        last = i;
        break;
      }
    }
    if (last == -1) {
      cout << -1 << '\n';
      continue;
    }
    for (int i = 0; i <= last; i++) ans.push_back({v[i].second, 1});
    for (int i = last + 1; i < n; i++) ans.push_back({v[i].second, 2});
    sort(ans.begin(), ans.end());
    for (pair<int, int> p : ans) cout << p.second << " ";
    cout << '\n';
  }
}
