#include <bits/stdc++.h>
using namespace std;
const long long BINF = 9e18, LINF = 2e9, P = 179, Q = 1791791791;
const long long MAXN = 2e5;
map<long long, long long> compress(vector<long long> a) {
  sort(a.begin(), a.end());
  a.resize(unique(a.begin(), a.end()) - a.begin());
  map<long long, long long> make_pair;
  for (long long i = 0; i < a.size(); ++i) make_pair[a[i]] = i;
  return make_pair;
}
long long l[MAXN], r[MAXN];
pair<long long, long long> t1[MAXN * 8], t2[MAXN * 8];
long long psh1[MAXN * 8], psh2[MAXN * 8];
void build(pair<long long, long long>* t, long long* psh, long long v,
           long long tl, long long tr) {
  if (tl == tr)
    t[v] = {0ll, 1ll}, psh[v] = 0;
  else {
    long long tm = (tl + tr) / 2;
    build(t, psh, v * 2, tl, tm);
    build(t, psh, v * 2 + 1, tm + 1, tr);
    t[v] = {0ll, tr - tl + 1};
    psh[v] = 0;
  }
}
void push(long long* psh, pair<long long, long long>* t, long long v,
          long long tl, long long tr) {
  if (tl != tr) {
    psh[v * 2] += psh[v];
    psh[v * 2 + 1] += psh[v];
  }
  t[v].first += psh[v];
  psh[v] = 0;
}
void recalc(pair<long long, long long>* t, long long v) {
  if (t[v * 2].first == t[2 * v + 1].first)
    t[v] = {t[v * 2].first, t[v * 2].second + t[v * 2 + 1].second};
  else
    t[v] = min(t[v * 2], t[v * 2 + 1]);
}
void add(pair<long long, long long>* t, long long* psh, long long v,
         long long tl, long long tr, long long l, long long r, long long d) {
  push(psh, t, v, tl, tr);
  if (r < tl || tr < l) return;
  if (l <= tl && tr <= r) {
    psh[v] += d;
    push(psh, t, v, tl, tr);
    return;
  }
  long long tm = (tl + tr) / 2;
  add(t, psh, v * 2, tl, tm, l, r, d);
  add(t, psh, v * 2 + 1, tm + 1, tr, l, r, d);
  recalc(t, v);
}
long long C;
long long f() { return (C + 1 - t1[1].second) - (C + 1 - t2[1].second); }
void solve() {
  long long n;
  cin >> n;
  vector<long long> v;
  for (long long i = 0; i < n; ++i) {
    cin >> l[i] >> r[i];
    v.push_back(l[i]);
    v.push_back(r[i]);
  }
  map<long long, long long> crd = compress(v);
  for (long long i = 0; i < n; ++i) l[i] = crd[l[i]], r[i] = crd[r[i]];
  C = crd.size();
  build(t1, psh1, 1, 0, C);
  build(t2, psh2, 1, 0, C);
  for (long long i = 0; i < n; ++i) {
    add(t1, psh1, 1, 0, C, l[i], r[i], 1);
    if (l[i] != r[i]) add(t2, psh2, 1, 0, C, l[i], r[i] - 1, 1);
  }
  long long ans = -1;
  for (long long i = 0; i < n; ++i) {
    add(t1, psh1, 1, 0, C, l[i], r[i], -1);
    if (l[i] != r[i]) add(t2, psh2, 1, 0, C, l[i], r[i] - 1, -1);
    ans = max(ans, f());
    add(t1, psh1, 1, 0, C, l[i], r[i], 1);
    if (l[i] != r[i]) add(t2, psh2, 1, 0, C, l[i], r[i] - 1, 1);
  }
  cout << ans << endl;
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cout.precision(40);
  long long t;
  cin >> t;
  for (long long i = 0; i < t; ++i) solve();
  return 0;
}
