/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 5000+100, M = 1e5+10, K = 52, MX = 30;
int n, L[N], R[N], q, DP[N][N];
int f(int l, int r){
if(DP[l][r] != -1) return DP[l][r];
for(int i = l; i <= r; ++i){
if(L[i] < l || r < R[i]){
DP[l][r] = min(DP[l][r] == -1 ? MOD : DP[l][r], f(min(L[i], l), max(R[i], r)) + 1);
}
}
if(DP[l][r] == -1) DP[l][r] = MOD;
return DP[l][r];
}
void solve(){
cin >> n;
vector<pii> v;
for(int i = 1; i <= n; ++i){
cin >> L[i] >> R[i];
v.pb({L[i], -R[i]});
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j) DP[i][j] = -1;
}
DP[1][n] = 0;
sort(all(v));
for(auto [l,r]: v){
// cout << l << ' ' << -r << endl;
f(l, -r);
}
cin >> q;
for(int j = 1; j <= q; ++j){
int i; cin >> i;
cout << (DP[L[i]][R[i]]==MOD?-1:DP[L[i]][R[i]]+1) << '\n';
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int tt = 1, aa;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
while(tt--){
solve();
en;
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
return 0;
}
