#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=2e5+5;
const int INF=1e9;
int n,q,node[N],dist[2][N*4],ans[N*4];
vii adj[N*4];
void build(int id=1, int l=1, int r=n){
if(l==r){
node[l]=id;
return;
}
int mid=(l+r)>>1;
build(id<<1,l,mid);
build(id<<1|1,mid+1,r);
adj[id<<1].eb(id,0);
adj[id<<1|1].eb(id,0);
}
void add(int u, int v, int x, int id=1, int l=1, int r=n){
if(u>r||v<l) return;
if(u<=l&&r<=v){
adj[id].eb(x,1);
return;
}
int mid=(l+r)>>1;
add(u,v,x,id<<1,l,mid);
add(u,v,x,id<<1|1,mid+1,r);
}
void dijkstra(int type, int s){
memset(dist[type],0x3f,sizeof(dist[type]));
dist[type][s]=0;
priority_queue<ii,vii,greater<ii>> pq;
pq.push({0,s});
while(pq.size()){
auto [du,u]=pq.top(); pq.pop();
for(auto [v,w]:adj[u]){
if(dist[type][v]>dist[type][u]+w){
dist[type][v]=dist[type][u]+w;
pq.push({dist[type][v],v});
}
}
}
}
void subtr(){
memset(ans,0x3f,sizeof(ans));
priority_queue<ii,vii,greater<ii>> pq;
foru(i,1,n){
ans[node[i]]=dist[0][node[i]]+dist[1][node[i]]-(i!=1&&i!=n);
pq.push({ans[node[i]],node[i]});
}
while(pq.size()){
auto [du,u]=pq.top(); pq.pop();
for(auto [v,w]:adj[u]){
if(ans[v]>ans[u]+w){
ans[v]=ans[u]+w;
pq.push({ans[v],v});
}
}
}
}
void solve(){
cin>>n;
build();
foru(i,1,n){
int l,r; cin>>l>>r;
add(l,r,node[i]);
}
dijkstra(0,node[1]);
dijkstra(1,node[n]);
subtr();
cin>>q;
foru(i,1,q){
int x; cin>>x;
cout<<(ans[node[x]]>=INF ? -1 : ans[node[x]])<<'\n';
}
}
int32_t main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
foru(i,1,tc){
solve();
}
}
