#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
int n;
pair<int, int> p[N];
int main() {
cin>>n;
for(int i = 1; i <= n; i++) {
int l, r;
cin>>l>>r;
p[i] = {r, l};
}
sort(p + 1, p + 1 + n);
int cnt = p[1].first;
int ans = 1;
for(int i = 2; i <= n; i++) {
if(p[i].second > cnt) {
cnt = p[i].first;
ans ++;
}
}
cout << ans << '\n';
}/*1691312853.0849724*/
129A - Cookies | 1367B - Even Array |
136A - Presents | 1450A - Avoid Trygub |
327A - Flipping Game | 411A - Password Check |
1520C - Not Adjacent Matrix | 1538B - Friends and Candies |
580A - Kefa and First Steps | 1038B - Non-Coprime Partition |
43A - Football | 50A - Domino piling |
479A - Expression | 1480A - Yet Another String Game |
1216C - White Sheet | 1648A - Weird Sum |
427A - Police Recruits | 535A - Tavas and Nafas |
581A - Vasya the Hipster | 1537B - Bad Boy |
1406B - Maximum Product | 507B - Amr and Pins |
379A - New Year Candles | 1154A - Restoring Three Numbers |
750A - New Year and Hurry | 705A - Hulk |
492B - Vanya and Lanterns | 1374C - Move Brackets |
1476A - K-divisible Sum | 1333A - Little Artem |