#include <bits/stdc++.h>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define sz(a) int(a.size())

template<class T> void cmax(T &a, const T &b) {a = max(a, b);}
template<class T> void cmin(T &a, const T &b) {a = min(a, b);}

void solve() {
  int n;
  cin >> n;
  vector<int> l(n), r(n);
  vector<int> a(n), b(n);
  a[0] = b[0] = 1;
  int j = 0;
  for (int i = 0; i < n; i++) {
    cin >> l[i] >> r[i];
    if (!i) continue;
    while (j < i && r[j] < l[i]) j++;
    if (r[i - 1] != r[i]) {
      a[i] = max(a[i - 1], b[i - 1]) + 1;
    }
    if (l[i - 1] != l[i]) {
      b[i] = max(a[min(j, i - 1)], b[i - 1]) + 1;
    }
    cmax(a[i], a[i - 1]);
    cmax(b[i], b[i - 1]);
  }
  cout << max(a[n - 1], b[n - 1]) << "\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}