#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long int XpowerY(long long int x, long long int y, long long int m) {
  long long int ans = 1;
  x = x % m;
  while (y > 0) {
    if (y % 2 == 1) ans = (ans * x) % m;
    x = ((x % m) * (x % m)) % m;
    y = y >> 1;
  }
  return ans % m;
}
int ans[100023];
int main() {
  int t;
  cin >> t;
  for (int ii = 0; ii < t; ii++) {
    vector<pair<pair<int, int>, int> > v;
    int n, l, r;
    cin >> n;
    for (int i = 0; i < n + 2; i++) ans[i] = 0;
    for (int i = 0; i < n; i++) {
      cin >> l >> r;
      v.push_back(make_pair(make_pair(l, r), i));
    }
    sort(v.begin(), v.end());
    int mx = -1;
    for (int i = 0; i < n; i++) {
      if (i == 0)
        ans[v[i].second] = 1;
      else if (v[i].first.first <= mx)
        ans[v[i].second] = ans[v[i - 1].second];
      else
        ans[v[i].second] = 3 - ans[v[i - 1].second];
      mx = max(mx, v[i].first.second);
    }
    int o = 0, t = 0;
    for (int i = 0; i < n; i++) {
      if (ans[i] == 1) o++;
      if (ans[i] == 2) t++;
    }
    if (o == 0 or t == 0)
      cout << -1 << endl;
    else {
      for (int i = 0; i < n; i++) cout << ans[i] << " ";
      cout << endl;
    }
  }
  return 0;
}
