#include <bits/stdc++.h>
#define rep(i, s, e) for (int i = s; i <= e; i++)
using namespace std;
const int N = 1e6 + 10;
int n, l[N], r[N], tr[N];
int query(int x)
{
    int ret = 0;
    for (; x; x -= x & -x)
        ret = max(ret, tr[x]);
    return ret;
}
void update(int x, int k)
{
    for (; x <= 2 * n; x += x & -x)
        tr[x] = max(tr[x], k);
}
struct node
{
    int x, y, no;
};
int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
    {
        cin >> n;
        rep(i, 1, 2 * n) tr[i] = 0;
        rep(i, 1, n) cin >> l[i] >> r[i];
        vector<node> v = {{2, 2 * l[1]}};
        rep(i, 2, n)
        {
            if (l[i] > l[i - 1])
                v.push_back({2 * i + 1, 2 * l[i] - 2});
            if (r[i] > r[i - 1])
                v.push_back({2 * i, 2 * r[i - 1] + 1});
        }
        sort(v.begin(), v.end(), [](node a, node b)
             { return a.y < b.y; });
        for (int i = 0; i < v.size(); i++)
        {
            v[i].no = i + 1;
        }
        sort(v.begin(), v.end(), [](node a, node b)
             { return a.x < b.x; });
        for (int i = 0; i < v.size(); i++)
        {
            update(v[i].no, query(v[i].no - 1) + 1);
        }
        cout << query(2 * n) << endl;
    }
}