#include <bits/stdc++.h> #define ll long long using namespace std; pair<int, int> a[100]; int main() { int x; cin >> x; while (x--) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i].second >> a[i].first; } sort(a+1, a+n+1); int tr = -1, ans=0; for (int i = 1; i <= n; i++) { if (a[i].second > tr) { tr = a[i].first; ans++; } } cout << ans << endl; } return 0; }