#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=5e5+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,L[N],R[N];
int d1[N],d2[N],d[N];
void BFS(int x,int *d){
	queue<int> q;
	if(x) fill(d+1,d+n+1,INF),d[x]=0,q.emplace(x);
	else for(int i=1;i<=n;i++) q.emplace(i);
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=1;i<=n;i++) if(L[i]<=x&&x<=R[i]&&d[i]>d[x]+1) d[i]=d[x]+1,q.emplace(i); 
	}
}
int main(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d%d",&L[i],&R[i]);
	BFS(1,d1);BFS(n,d2);
	for(i=1;i<=n;i++) d[i]=d1[i]+d2[i];
	BFS(0,d);
	int q;scanf("%d",&q);while(q--){
		int x;scanf("%d",&x);
		printf("%d\n",d[x]>n+1?-1:d[x]);
	}
}