#include <bits/stdc++.h>
using namespace std;
vector<long long> tree;
vector<long long> lazy;
void update_lazy(vector<long long> &tree, vector<long long> &lazy, int node,
                 int start, int end) {
  if (lazy[node] != 0) {
    tree[node] += (end - start + 1) * lazy[node];
    if (start != end) {
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
  }
}
void update_range(vector<long long> &tree, vector<long long> &lazy, int node,
                  int start, int end, int left, int right, long long diff) {
  update_lazy(tree, lazy, node, start, end);
  if (left > end || right < start) {
    return;
  }
  if (left <= start && end <= right) {
    tree[node] += (end - start + 1) * diff;
    if (start != end) {
      lazy[node * 2] += diff;
      lazy[node * 2 + 1] += diff;
    }
    return;
  }
  update_range(tree, lazy, node * 2, start, (start + end) / 2, left, right,
               diff);
  update_range(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left,
               right, diff);
  tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
long long sum(vector<long long> &tree, vector<long long> &lazy, int node,
              int start, int end, int left, int right) {
  update_lazy(tree, lazy, node, start, end);
  if (left > end || right < start) {
    return 0;
  }
  if (left <= start && end <= right) {
    return tree[node];
  }
  return sum(tree, lazy, node * 2, start, (start + end) / 2, left, right) +
         sum(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left, right);
}
int L[100005], R[100005];
vector<int> X;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int T;
  cin >> T;
  while (T--) {
    int N;
    cin >> N;
    X.resize(2 * N);
    tree.resize(16 * N);
    lazy.resize(16 * N);
    for (int i = 0; i < 16 * N; i++) {
      tree[i] = 0;
      lazy[i] = 0;
    }
    for (int i = 0; i < N; i++) {
      cin >> L[i] >> R[i];
      X[2 * i] = L[i];
      X[2 * i + 1] = R[i];
    }
    sort(X.begin(), X.end());
    X.resize(unique(X.begin(), X.end()) - X.begin());
    for (int i = 0; i < N; i++) {
      L[i] = lower_bound(X.begin(), X.end(), L[i]) - X.begin();
      R[i] = lower_bound(X.begin(), X.end(), R[i]) - X.begin();
      update_range(tree, lazy, 1, 0, 4 * N - 1, 2 * L[i], 2 * R[i], 1LL);
    }
    int k = -1;
    for (int i = 1; i < 4 * N; i += 2) {
      if (sum(tree, lazy, 1, 0, 4 * N - 1, i, i) == 0LL) {
        k = i;
        break;
      }
    }
    int f = -1;
    for (int i = 0; i < N; i++) {
      if (2 * R[i] > k) {
        f = 1;
        break;
      }
    }
    if (f == -1) {
      cout << -1 << '\n';
      continue;
    }
    for (int i = 0; i < N; i++) {
      cout << (2 * R[i] < k ? 1 : 2) << ' ';
    }
    cout << '\n';
  }
}
