#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
const int N = 1e6 + 5;
// const int B = 340;
// const int M = 5e3 + 5;
// const int base = 1753591;
// const int mod = 998244353;
// const int mod = 1e9 + 7;
// const double pi = acos(-1);

int n, a[N], b[N];
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i] >> b[i];
    int ans = 1;
    for (int i = n, lst = 1e9; i >= 1; i--)
    {
        lst = min(lst, b[i]);
        if (lst < a[i])
        {
            ans++;
            lst = b[i];
        }
    }
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    cout << fixed << setprecision(10);
    while (t--)
        solve();
}