#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int lgN = 1e6 + 5;
const int te = 3e8 + 1;
const long long int MOD = 998244353;
const long double pi = 3.141592653589793238462643383;
const long long int IMAX = LLONG_MAX;
const double PI = 3.141592653589793;
template <class T>
using max_pq = priority_queue<T>;
template <class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
long long int x, y;
template <class T>
T gcd(T a, T b) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  T gc = gcd(b % a, a);
  T temp;
  temp = x;
  x = y - (b / a) * temp;
  y = temp;
  return gc;
}
long long int po(long long int a, long long int x, long long int m) {
  if (x == 0) {
    return 1;
  }
  long long int ans = 1;
  long long int k = 1;
  while (k <= x) {
    if (x & k) {
      ans = ((ans * a) % m);
    }
    k <<= 1;
    a *= a;
    a %= m;
  }
  return ans;
}
bool comp(
    pair<pair<long long int, long long int>, pair<long long int, long long int>>
        p1,
    pair<pair<long long int, long long int>, pair<long long int, long long int>>
        p2) {
  long long int a = p1.second.first;
  long long int b = p2.second.first;
  if (a < b)
    return true;
  else
    return false;
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    vector<pair<pair<long long int, long long int>,
                pair<long long int, long long int>>>
        v;
    long long int i;
    for (i = int(0); i <= int(n - 1); i++) {
      long long int x, y;
      cin >> x >> y;
      v.push_back(make_pair(make_pair(x, y), make_pair(i, 0)));
    }
    sort(v.begin(), v.end());
    v[0].second.second = 1;
    long long int maxi = v[0].first.second;
    for (i = 1; i < v.size(); i++) {
      if ((v[i].first.first) > maxi)
        break;
      else {
        v[i].second.second = 1;
      }
      maxi = max(maxi, v[i].first.second);
    }
    bool yes = false;
    for (i = i; i < v.size(); i++) {
      yes = true;
      v[i].second.second = 2;
    }
    if (yes == false)
      cout << "-1";
    else {
      sort(v.begin(), v.end(), comp);
      for (i = int(0); i <= int(n - 1); i++) {
        cout << v[i].second.second << " ";
      }
    }
    cout << "\n";
  }
}
