#include<iostream>#include<cstring>#include<algorithm>#definexfirst#defineysecondusingnamespace std;typedef pair<int,int> PII;constint N =100010, INF =1e8;int n;
PII q[N];int smax[N], smin[N];//前缀最值intmain(){
cin >> n;for(int i =1; i <= n; i ++)scanf("%d%d",&q[i].x,&q[i].y);//存储每条线的信息sort(q +1, q +1+ n);
smax[0]=-INF, smin[n +1]= INF;//预处理前缀最值for(int i =1; i <= n; i ++) smax[i]=max(smax[i -1], q[i].y);for(int i = n; i; i --) smin[i]=min(smin[i +1], q[i].y);int res =0;for(int i =1; i <= n; i ++)if(smax[i -1]< q[i].y && smin[i +1]> q[i].y) res ++;printf("%d\n", res);return0;}