#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    return x*f;
}
inline void write(int x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
int n;
struct node{
    int l,r;
    bool operator<(const node&A)const{
        if(l!=A.l)return l<A.l;
        return r>A.r;
    }
}a[100001];
int Max;
int ans=0;
signed main(){
    n=read();
    for(int i=1;i<=n;i++){
        a[i].l=read();
        a[i].r=read();
    }
    sort(a+1,a+n+1);
    Max=a[1].r;
    for(int i=2;i<=n;i++){
        if(a[i].r<Max)ans++;
        else Max=a[i].r;
    }
    write(ans);
    
    return 0;
}