#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=3e3+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],q,ans[N],dp[N][N];
int mx[N][20],mi[N][20];
int qx(int x,int y){int d=__lg(y-x+1);return max(mx[x][d],mx[y-(1<<d)+1][d]);}
int qi(int x,int y){int d=__lg(y-x+1);return min(mi[x][d],mi[y-(1<<d)+1][d]);}
int main(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d%d",&L[i],&R[i]);
	if(n>2500){
		int ans=1,r=R[1],Mx=R[1];
		for(i=2;i<=n;i++){
			if(i>r){
				if(i>Mx) {puts("-1");return 0;}
				ans++;r=Mx;
			}
			Mx=max(Mx,R[i]);
		}
		printf("%d\n",ans);
		return 0;
	}
	for(i=n;i;i--){
		for(mi[i][0]=L[i],j=1;i+(1<<j)-1<=n;j++) mi[i][j]=min(mi[i][j-1],mi[i+(1<<j-1)][j-1]);
		for(mx[i][0]=R[i],j=1;i+(1<<j)-1<=n;j++) mx[i][j]=max(mx[i][j-1],mx[i+(1<<j-1)][j-1]);
	}
	Me(dp,0x3f);Me(ans,0x3f);
	dp[1][n]=0;
	for(i=n-1;i;i--){
		for(j=1;j<=n;j++) ans[j]=min(ans[j],dp[L[j]][R[j]]+1);
		for(j=1;j+i-1<=n;j++) {
			int l=j,r=j+i-1;
			for(h=l;h<=r;h++) dp[l][r]=min(dp[l][r],ans[h]);
			dp[l][r]=min(dp[l][r],min(dp[qi(l,r)][r],dp[l][qx(l,r)])+1);
			// cerr<<l<<' '<<r<<' '<<dp[l][r]<<'\n';
		}
	}
	int q;scanf("%d",&q);
	while(q--){
		int x;scanf("%d",&x);
		printf("%d\n",ans[x]>n+1?-1:ans[x]);
	}
}