#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<pair<int,int>> a;

int consistency(int n){

    sort(begin(a), end(a), [](const pair<int,int>& a, const pair<int,int>& b){
        return a.second < b.second;
    });

    int ans = 0;
    int x = -1, y = -1;
    for(int i=0; i<n; i++){
        int s = a[i].first;
        int e = a[i].second;

        if(x==-1 && y==-1){
            x = s;
            y = e;
            ans++;
        }
        else if(y > s){
            continue;
        }
        else{
            x = s;
            y = e;
            ans++;
        }
    }



    return ans;    
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++){
        int x, y;
        cin >> x >> y;
        a[i] = {x, y};
    }
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}