#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
pii arr[305];
int n;
int memo[305][305];
int dp(int l, int r){
if(l==1&&r==n) return 0;
if(memo[l][r]!=-1) return memo[l][r];
int ans=1e15;
for(int x=l;x<=r;x++){
if(arr[x].first<l||arr[x].second>r){
ans=min(ans,dp(min(l,arr[x].first),max(r,arr[x].second))+1);
}
}
return memo[l][r]=ans;
}
void solve(){
cin >> n;
for(int x=1;x<=n;x++){
cin >> arr[x].first >> arr[x].second;
}
int q;
cin >> q;
int temp;
memset(memo,-1,sizeof(memo));
for(int x=0;x<q;x++){
cin >> temp;
int hold=dp(arr[temp].first,arr[temp].second);
if(hold>1e12){
cout << -1 << "\n";
}
else cout << hold+1 << "\n";
}
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//freopen("in.txt","r",stdin);
//cin >> t;
while(t--){
solve();
}
}
