#include<bits/stdc++.h>
#define vc vector
#define pb push_back
#define pf push_front
#define pof pop_front
#define mkp make_pair
using namespace std;
const int N=1e6+5,inf=1e7;

inline int read() {
	int x=0,w=0; char ch=getchar();
	while(!isdigit(ch)) w|=(ch=='-'), ch=getchar();
	while(isdigit(ch)) x=x*10+(ch^48), ch=getchar();
	return w?-x:x;
}
inline void write(int x) { 
	if(x<0) putchar('-'), x=-x;
	if(x>9) write(x/10); putchar(x%10+'0'); 
}
inline void writee(int x) { write(x); putchar(10); }

int n,q,idx;
int id[N],dist[N],d[N];
int hd[N],to[N<<1],ne[N<<1],e[N<<1],tc=1;
bool vis[N];

inline void add(int x,int y,int z) {
	to[++tc]=x; ne[tc]=hd[y]; hd[y]=tc; e[tc]=z;
}
inline void bfs(int s,int *d) {
	for(int i=1;i<=idx;i++) d[i]=inf, vis[i]=0;
	d[s]=0; deque<int> Q; Q.pb(s); int x;
	while(Q.size()) {
		x=Q.front(); Q.pof();
		if(vis[x]) continue; vis[x]=1;
		for(int i=hd[x],y;i;i=ne[i]) 
			if(!vis[y=to[i]] && d[x]+e[i]<d[y]) {
				d[y]=d[x]+e[i];
				if(e[i]) Q.pb(y);
				else Q.pf(y);
			}
	}
}
inline void dijkstra() {
	priority_queue<pair<int,int> > Q;
	for(int i=1;i<=idx;i++) Q.push(mkp(-dist[i],i)), vis[i]=0;
	int x;
	while(Q.size()) {
		x=Q.top().second; Q.pop();
		if(vis[x]) continue; vis[x]=1;
		for(int i=hd[x],y;i;i=ne[i]) 
			if(!vis[y=to[i]] && dist[x]+e[i]<dist[y])
				dist[y]=dist[x]+e[i], Q.push(mkp(-dist[y],y));
	}
}

#define mid (l+r>>1)
#define ls (k<<1)
#define rs (k<<1|1)
inline void build(int k,int l,int r) {
	if(l==r) return idx=max(idx,id[l]=k), void();
	add(k,ls,0); add(k,rs,0);
	build(ls,l,mid); build(rs,mid+1,r);
}
inline void ins(int k,int l,int r,int L,int R,int x) {
	if(L>R || L>r || R<l) return ;
	if(L<=l && R>=r) return add(x,k,0);
	ins(ls,l,mid,L,R,x); ins(rs,mid+1,r,L,R,x);
}

int main() {
	//freopen("ex_4.in","r",stdin);
	//freopen("a.in","r",stdin);
	
	n=read(); build(1,1,n); 
	for(int i=1,L,R;i<=n;i++) {
		add(id[i],++idx,1);
		L=read(), R=read(), ins(1,1,n,L,R,idx);
	}
	
	bfs(id[1],d); for(int i=1;i<=idx;i++) dist[i]+=d[i];
	bfs(id[n],d); for(int i=1;i<=idx;i++) dist[i]+=d[i];
	dijkstra();
	
	q=read(); int x;
	while(q--) {
		x=read();
		if(dist[id[x]]>n) puts("-1");
		else writee(dist[id[x]]);
	}
	return 0;
}