#include <bits/stdc++.h>

#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
int mod=998244353;

const int N=200007,pot=1<<18;

pair<int,int>seg[2*pot+7];

pair<int,int>que(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg[v];
	if(r<a||l>b) return {inf,0};
	return min(que(2*v,a,b,l,(l+r)/2),que(2*v+1,a,b,(l+r)/2+1,r));
}

pair<int,int>seg1[2*pot+7];

pair<int,int>que1(int v,int a,int b,int l,int r)
{
	if(a<=l&&b>=r) return seg1[v];
	if(r<a||l>b) return {-inf,0};
	return max(que1(2*v,a,b,l,(l+r)/2),que1(2*v+1,a,b,(l+r)/2+1,r));
}

vector<int>G[N];
bool odw[N];
int l[N],r[N];
int L[N],R[N];
int A[N],B[N];
vector<int>X[N],Y[N];
int ans[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
		A[i]=inf;
		B[i]=inf;
	}
    for(int i=1;i<=n;i++) 
    {
		cin>>l[i]>>r[i];
		if(l[i]==1) A[i]=0;
		if(r[i]==n) B[i]=0;
		X[l[i]].pb(i);
		Y[r[i]].pb(i);
		seg[i+pot-1]={l[i],i};
		seg1[i+pot-1]={r[i],i};
	}
	for(int i=n+1;i<=pot;i++)
	{
		seg[i+pot-1]={inf,i};
		seg1[i+pot-1]={-inf,i};
	}
	for(int i=pot-1;i>0;i--) 
	{
		seg[i]=min(seg[2*i],seg[2*i+1]);
		seg1[i]=max(seg1[2*i],seg1[2*i+1]);
	}
	for(int i=1;i<=n;i++)
	{
		L[i]=que(1,l[i],r[i],1,pot).nd;
		R[i]=que1(1,l[i],r[i],1,pot).nd;
		G[L[i]].pb(i);
		G[R[i]].pb(i);
	}
    for(int i=2;i<=n;i++)
    {
		for(auto j:X[i]) A[j]=A[L[j]]+1;
	}
	for(int i=n-1;i>0;i--)
	{
		for(auto j:Y[i]) B[j]=B[R[j]]+1;
	}
	priority_queue<pair<int,int>>Q;
	for(int i=1;i<=n;i++) 
	{
		ans[i]=A[i]+B[i]+1;
		Q.push({-ans[i],i});
	}
    while(sz(Q)>0)
    {
		int v=Q.top().nd;
		Q.pop();
		if(odw[v]) continue;
		odw[v]=1;
		for(auto u:G[v])
		{
			if(ans[v]+1<ans[u])
			{
				ans[u]=ans[v]+1;
				Q.push({-ans[u],u});
			}
		}
	}
    int q,x;
    cin>>q;
    while(q--)
    {
		cin>>x;
		if(ans[x]>n) cout<<-1<<endl;
		else cout<<ans[x]<<endl;
	}
    return 0;
}