#include <algorithm>
#include <cstdio>
#define N 1000009
#define RI register int
#define lowbit(x) (x & -x)
using namespace std;

int n, C[N], ans;

struct DT {
    int l, r;
} a[N];

inline int read();
bool cmp(DT x, DT y) { return x.r == y.r ? x.l < y.l : x.r < y.r; }
inline void add(int x) {
    for (RI i = x; i < N; i += lowbit(i)) ++C[i];
}
inline int qry(int x, int ret = 0) {
    for (RI i = x; i; i -= lowbit(i)) ret += C[i];
    return ret;
}

int main() {
    n = read();
    for (RI i = 1; i <= n; ++i) a[i].l = read(), a[i].r = read();
    sort(a + 1, a + 1 + n, cmp);
    for (RI i = 1; i <= n; ++i)
        if (qry(a[i].r) == qry(a[i].l - 1))
            ++ans, add(a[i].r);
    printf("%d\n", ans);
    return 0;
}

inline int read() {
    int x = 0;
    char c = getchar();
    while (c > '9' || c < '0') c = getchar();
    while (c >= '0' && c <= '9') {
        x *= 10;
        x += c - '0';
        c = getchar();
    }
    return x;
}