bool comp(pair<int, int> &a, pair<int, int> &b)
{
    if (a.first == b.first)
        return a.second < b.second;
    else
        return a.first > b.first;
}

void solve()
{
    int n, Minn = INT_MAX, holder;
    cin >> n;
    int ans = n;
    vector<pair<int, int>> v(n);
    for (auto &i : v)
        cin >> i.first >> i.second;
    sort(v.begin(), v.end(), comp);
    for (int i = 1; i < n; i++)
    {
        if (v[i].second >= v[i - 1].second)
        {
            ans = (Minn == INT_MAX ? ans - 1 : ans - holder);
            Minn = INT_MAX;
        }
        else
            Minn = min(Minn, v[i].second), holder = i + 1;
    }
    cout << ans << endl;
}