#include<bits/stdc++.h>
#define RI register int
#define err puts("asd")
#define ll long long
#define ull unsigned long long
#define LL __int128
#define mk make_pair
#define fl fflush(stdout)
//#define int long long
using namespace std;

inline ll read(){
	ll s=0;register char c=getchar();bool f=0;
	while(c<'0'||c>'9'){if(c=='-') f=1;c=getchar();}
	while(c>='0'&&c<='9') s=(s<<3)+(s<<1)+c-48,c=getchar();
	return f?-s:s; 
}

const int N=2e5+5;
const int inf=1e9;

int n,L[N],R[N],las[N],f[20][N],pre[N],dis[N],maxl[N<<2],d[N],cnt,t;
set<int>S[N<<2];
set<int>::iterator it;
vector<int>dep[N];

inline void insert(int x,int l,int r,int L,int R,int v){
	if(L<=l&&r<=R){
		//cout<<l<<' '<<r<<' '<<v<<endl;
		if(v>0) S[x].insert(v);
		else S[x].erase(-v);
		return;
	}
	RI mid=l+r>>1;
	if(L<=mid) insert(x<<1,l,mid,L,R,v);
	if(R>mid) insert(x<<1|1,mid+1,r,L,R,v);
}

inline void Do(int pos){
	RI now=cnt,x=1,y,l=1,r=n,mid;
	while(l!=r){
		mid=l+r>>1;
		for(it=S[x].begin();it!=S[x].end();++it){
			y=*it;dis[y]=dis[pos]+1;
			d[++cnt]=y;
		}
		if(pos<=mid) x<<=1,r=mid;
		else x=x<<1|1,l=mid+1;
	}
	for(it=S[x].begin();it!=S[x].end();++it){
		y=*it;dis[y]=dis[pos]+1;
		d[++cnt]=y;
	}
	for(RI i=now+1;i<=cnt;++i)
		insert(1,1,n,L[d[i]],R[d[i]],-d[i]);
}

inline void update(int pos,int v){
	RI x=1,l=1,r=n,mid;
	while(l!=r){
		mid=l+r>>1;maxl[x]=max(maxl[x],v);
		if(pos<=mid) x<<=1,r=mid;
		else x=x<<1|1,l=mid+1;	
	}
	maxl[x]=max(maxl[x],v);
}

inline int ask(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R) return maxl[x];
	RI mid=l+r>>1,ans=0;
	if(L<=mid) ans=ask(x<<1,l,mid,L,R);
	if(R>mid) ans=max(ans,ask(x<<1|1,mid+1,r,L,R));
	return ans;
}

signed main(){
	//freopen("1.cpp","r",stdin);
	//freopen("2.cpp","w",stdout);
	n=read();
	for(RI i=1;i<=n;++i){
		L[i]=read(),R[i]=read();
		if(i!=1) insert(1,1,n,L[i],R[i],i),dis[i]=inf;
	}
	d[cnt=1]=1;dis[1]=0;
	for(RI i=1;i<=cnt;++i) Do(d[i]),dep[dis[d[i]]].push_back(d[i]);
	update(1,las[1]=1);
	RI x,y,z;
	for(RI i=1;!dep[i].empty();++i){
		for(RI j=0;j<dep[i].size();++j){
			x=dep[i][j];
			las[x]=max(R[x],ask(1,1,n,L[x],R[x]));
		}
		for(RI j=0;j<dep[i].size();++j){
			x=dep[i][j];
			update(x,las[x]);
		}	
	}
	for(RI i=1;i<=n;++i) pre[i]=max(pre[i-1],R[i]),f[0][i]=pre[i];
	t=log2(n)+1;
	for(RI i=1;i<=t;++i)
		for(RI j=1;j<=n;++j)
			f[i][j]=f[i-1][f[i-1][j]];	
	//cout<<f[0][3]<<endl;
	RI Q=read(),ans=0;
	while(Q--){
		x=read();ans=dis[x];
		if(ans==inf){puts("-1");continue;}
		x=las[x];
		if(x==n){printf("%d\n",ans);continue;}
		for(RI i=t;i>=0;--i)
			if(f[i][x]!=n) x=f[i][x],ans+=1<<i;
		if(f[0][x]==n) printf("%d\n",ans+1	);
		else puts("-1");
	}
	return 0;                                 
}