#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define rd_init() char*rp=({char*mmap();mmap(0l,1l<<25,1,2,0,0ll);})
#define rd() ({int _v=0,_c;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_v;})
#define wt(v) ({ulong _z=v;do*--wp=_z%10+48;while(_z/=10);})
#define wt1(v) ({char wbuf[64],*wp=wbuf+sizeof wbuf;wt(v);write(1,wp,wbuf+sizeof wbuf-wp);})
#define rep(v,e) for(typeof(e)v=0;v<e;++v)
#define rrep(v,e) for(typeof(e)v=e;v--;)

typedef unsigned long ulong;

char wbuf[1<<25];
int a[400000];
ulong p[400000];
int z[200000];
int n,q;
int e,d[100001];

void sort_aux(unsigned*a,unsigned*b,ulong*p,ulong*q){
	int c[256];
	for(int i=0;i<256;++i){
		c[i]=0;
	}
	for(int i=0;i<n;++i){
		++c[a[i]&255];
	}
	int t=0;
	for(int i=0;i<256;++i){
		int u=c[i];
		c[i]=t;
		t+=u;
	}
	for(int i=0;i<n;++i){
		int k=c[a[i]&255]++;
		b[k]=a[i]>>8|a[i]<<24;
		q[k]=p[i];
	}
}

void sort(){
	static unsigned b[400000];
	static ulong q[400000];
	sort_aux(a,b,p,q);
	sort_aux(b,a,q,p);
	sort_aux(a,b,p,q);
	sort_aux(b,a,q,p);
}

int main(){
	{
		rd_init();
		n=rd();
		rep(i,n){
			a[i]=rd();
			p[i]=rd();
		}
		q=rd();
		rep(i,q){
			a[n+i]=rd();
			p[n+i]=rd()|i+1ull<<32;
		}
	}
	n+=q;
	sort();
	rep(i,n){
		int r=(p[i]>>32)-1;
		if(r>=0){
			z[r]=e-d[(int)p[i]];
		}else{
			++e;
			++d[(int)p[i]];
		}
	}
	{		
		char*wp=wbuf+sizeof wbuf;
		rrep(i,q){
			*--wp='\n';
			wt(z[i]);
		}
		write(1,wp,wbuf+sizeof wbuf-wp);
	}
	_exit(0);
}