#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 6;
int T;
int n, tot, x, cnt;
map<int, int> mapp;
vector<int> v;
template <class T>
void read(T &x, int f = 1) {
  char ch = getchar();
  x = 0;
  while (ch < '0' || ch > '9') f = (ch == '-' ? -1 : 1), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  x *= f;
}
struct node {
  node *lson, *rson;
  int cnt, cover, l, r;
  int mxl, mxr;
} tr[maxn * 8], *root;
struct segment {
  int l, r;
} s[maxn];
inline node *Newnode(node *&root) { return root = &tr[tot++]; }
inline void update(node *cur) {
  if (cur->cover)
    cur->cnt = 1, cur->mxl = cur->l, cur->mxr = cur->r;
  else {
    cur->mxl = cur->mxr = 0;
    if (cur->l == cur->r) {
      cur->cnt = 0;
      return;
    }
    if (cur->lson->mxr == cur->rson->mxl - 1)
      cur->cnt = cur->lson->cnt + cur->rson->cnt - 1;
    else
      cur->cnt = cur->lson->cnt + cur->rson->cnt;
    if (!cur->lson->mxl) {
      if (cur->rson->mxl)
        cur->mxl = cur->rson->mxl;
      else
        cur->mxl = 0;
    } else
      cur->mxl = cur->lson->mxl;
    if (!cur->rson->mxr) {
      if (cur->lson->mxr)
        cur->mxr = cur->lson->mxr;
      else
        cur->mxr = 0;
    } else
      cur->mxr = cur->rson->mxr;
  }
}
void build(node *cur, int l, int r) {
  cur->l = l, cur->r = r;
  cur->cover = cur->cnt = 0;
  cur->mxl = cur->mxr = 0;
  if (l == r) return;
  int mid = l + r >> 1;
  build(Newnode(cur->lson), l, mid);
  build(Newnode(cur->rson), mid + 1, r);
}
void modify(node *cur, int l, int r, int v) {
  if (r < l) l = r;
  if (cur->l == l && cur->r == r) {
    cur->cover += v;
    update(cur);
    return;
  }
  int mid = cur->l + cur->r >> 1;
  if (r <= mid)
    modify(cur->lson, l, r, v);
  else if (l > mid)
    modify(cur->rson, l, r, v);
  else
    modify(cur->lson, l, mid, v), modify(cur->rson, mid + 1, r, v);
  update(cur);
}
void Discretization() {
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size(); i++)
    if (!mapp[v[i]]) cnt++, mapp[v[i]] = cnt;
}
int main() {
  read(T);
  while (T--) {
    read(n);
    for (int i = 1; i <= n; i++)
      read(s[i].l), read(s[i].r), v.push_back(s[i].l), v.push_back(s[i].r);
    tot = cnt = 0;
    Discretization();
    build(Newnode(root), 1, 2 * cnt);
    for (int i = 1; i <= n; i++)
      modify(root, mapp[s[i].l] * 2, mapp[s[i].r] * 2 - 1, 1);
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      modify(root, mapp[s[i].l] * 2, mapp[s[i].r] * 2 - 1, -1);
      ans = max(ans, root->cnt);
      modify(root, mapp[s[i].l] * 2, mapp[s[i].r] * 2 - 1, 1);
    }
    printf("%d\n", ans);
    v.clear(), mapp.clear();
  }
  return 0;
}
