#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int ts[101], te[101], t;
int count = 0;
// 输入数据
for (int i = 0; i < n; i++) {
cin >> ts[i];
cin >> te[i];
}
// 排序
for (int i = 0; i < n; i++) {
for (int j = i; j < n - 1; j++) {
if (te[i] > te[j + 1]) {
t = te[i];
te[i] = te[j + 1];
te[j + 1] = t;
t = ts[i];
ts[i] = ts[j + 1];
ts[j + 1] = t;
}
}
}
// 添加数据
count = 1;
int k = te[0];
for (int i = 1; i < n; i++) {
if (k <= ts[i]) {
k = te[i];
count++;
}
}
cout << count << endl;
}
return 0;
}