#include <algorithm>
#include <iostream>

using namespace std;

constexpr int N = 1e5;

int maxl[N][896], l[2 * N], r[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  for (int i = 0, a, b; i < n; ++i) cin >> a >> b, l[--b] = --a, r[i] = b;
  sort(r, r + n);
  maxl[0][0] = 2 * N;
  maxl[0][1] = l[r[0]];
  fill(maxl[0] + 2, maxl[1], -1);
  for (int i = 1; i < n; ++i) {
    copy(maxl[i - 1], maxl[i], maxl[i]);
    int j = 0; while (maxl[i - 1][j] > l[r[i]]) ++j;
    int t = lower_bound(r, r + n, l[r[i]]) - r - 1;
    if (~t) for (int k = 0; ~maxl[t][k]; ++k) maxl[i][j + k] = max(maxl[i][j + k], min(l[i], maxl[t][k]));
    else maxl[i][j] = l[i];
  }
  int ans = 0;
  while (~maxl[n - 1][ans]) ++ans;
  cout << ans - 1 << '\n';
}