// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
template<class T>
bool minimize(T &a, const T &b) {
if (a > b) return a = b, true;
return false;
}
template<class T>
bool maximize(T &a, const T &b) {
if (a < b) return a = b, true;
return false;
}
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
const int MOD = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 27092008;
const int N = 2500 + 5;
int n, f[N][N], l[N], r[N];
int mx[N][N], mn[N][N];
int dp(int s) {
memset(f, 0x3f, sizeof f);
f[l[s]][r[s]] = 1;
FORR(i, l[s], 1) FOR(j, r[s], n) {
minimize(f[mn[i][j]][mx[i][j]], f[i][j] + 1);
}
return f[1][n];
}
void init(void) {
cin >> n;
FOR(i, 1, n) cin >> l[i] >> r[i];
}
void process(void) {
memset(mn, 0x3f, sizeof mn);
FOR(i, 1, n) FOR(j, i, n) {
mx[i][j] = max(mx[i][j - 1], r[j]);
mn[i][j] = min(mn[i][j - 1], l[j]);
}
int q;
cin >> q;
while(q--) {
int x; cin >> x;
int ans = dp(x);
cout << (ans == inf ? -1 : ans) << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) {
init();
process();
}
return 0;
}
