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

int CeilIndex(std::vector<int>& v, int l, int r, int key)
{
    while (r - l > 1) {
        int m = l + (r - l) / 2;
        if (v[m] >= key)
            r = m;
        else
            l = m;
    }

    return r;
}

int LongestIncreasingSubsequenceLength(std::vector<int>& v)
{
    if (v.size() == 0)
        return 0;

    std::vector<int> tail(v.size(), 0);
    int length = 1; // always points empty slot in tail

    tail[0] = v[0];
    for (size_t i = 1; i < v.size(); i++) {

        // new smallest value
        if (v[i] < tail[0])
            tail[0] = v[i];

        // v[i] extends largest subsequence
        else if (v[i] > tail[length - 1])
            tail[length++] = v[i];

        // v[i] will become end candidate of an existing
        // subsequence or Throw away larger elements in all
        // LIS, to make room for upcoming grater elements
        // than v[i] (and also, v[i] would have already
        // appeared in one of LIS, identify the location
        // and replace it)
        else
            tail[CeilIndex(tail, -1, length - 1, v[i])] = v[i];
    }

    return length;
}
int main()
{
    int n,a,b,i;
    cin>>n;
    vector<pair<int,int> >vec;
    for(i=0;i<n;i++)
    {
        cin>>a>>b;
        vec.push_back({a,b});

    }
    sort(vec.begin(),vec.end());
    vector<int> arr;
    for(i=0;i<n;i++)
    arr.push_back(vec[i].second);
    cout<<LongestIncreasingSubsequenceLength(arr)<<endl;
    return 0;
}