#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
int dis[N],L[N],R[N],n,q;
void dijkstra(int s){
for (int i=1;i<=n;i++) dis[i]=INT_MAX;
dis[s]=0;
queue<int> q;q.push(s);
while (!q.empty()){
int x=q.front();q.pop();
for (int i=L[x];i<=R[x];i++){
if (dis[i]!=INT_MAX) continue;
dis[i]=dis[x]+1;
q.push(i);
}
}return;
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n;
for (int i=1;i<=n;i++) cin>>L[i]>>R[i];
cin>>q;
while (q--){
int x;cin>>x;
dijkstra(x);
int mx=0;
for (int i=1;i<=n;i++) mx=max(mx,dis[i]);
if (mx>=INT_MAX) cout<<-1<<endl;
else cout<<mx<<endl;
}
return 0;
}
