#include <bits/stdc++.h>
using namespace std;
void file() {}
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main() {
  file();
  fast();
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> v(n);
    vector<vector<int>> a(n, vector<int>(3));
    for (int i = 0; i < n; i++) {
      cin >> a[i][0] >> a[i][1];
      a[i][2] = i;
    }
    sort(a.begin(), a.end());
    int x = -1;
    int mx = a[0][1];
    for (int i = 1; i < n; i++) {
      if (a[i][0] > mx) {
        x = i;
        break;
      }
      mx = max(mx, a[i][1]);
    }
    if (x == -1)
      cout << x << endl;
    else {
      for (int i = 0; i < n; i++) v[a[i][2]] = i;
      for (int i = 0; i < n; i++)
        if (v[i] < x)
          cout << 1 << " ";
        else
          cout << 2 << " ";
      cout << endl;
    }
  }
}
