// ~~ 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, L[N], R[N], leaf[N];
vector<int> G[N << 2];
int dist[N << 2];
bool isleaf[N];
void buildGraph(int id, int l, int r) {
if (l == r) {
leaf[l] = id;
isleaf[id] = true;
return;
}
int mid = (l + r) >> 1;
buildGraph(id << 1, l, mid);
buildGraph(id << 1 | 1, mid + 1, r);
G[id].emplace_back(id << 1);
G[id].emplace_back(id << 1 | 1);
}
void buildEdge(int id, int l, int r, int u, int v, int src) {
if (l > v || r < u) return;
if (u <= l && r <= v) {
G[src].emplace_back(id);
return;
}
int mid = (l + r) >> 1;
buildEdge(id << 1, l, mid, u, v, src);
buildEdge(id << 1 | 1, mid + 1, r, u, v, src);
}
int getSum(int id, int l, int r) {
if (dist[id] != inf || l == r) return dist[id];
int mid = (l + r) >> 1;
return min(inf, getSum(id << 1, l, mid) + getSum(id << 1 | 1, mid + 1, r));
}
void init(void) {
cin >> n;
FOR(i, 1, n) cin >> L[i] >> R[i];
buildGraph(1, 1, n);
FOR(i, 1, n) buildEdge(1, 1, n, L[i], R[i], leaf[i]);
}
void process(void) {
int q; cin >> q;
while(q--) {
int x; cin >> x;
memset(dist, 0x3f, sizeof dist);
priority_queue<ii, vector<ii>, greater<ii>> Q;
Q.push(mp(1, leaf[x]));
dist[leaf[x]] = 1;
while(!Q.empty()) {
int du, u; tie(du, u) = Q.top(); Q.pop();
if (du != dist[u]) continue;
for(int v : G[u]) if (minimize(dist[v], dist[u] + isleaf[v]))
Q.push(mp(dist[v], v));
}
int ans = getSum(1, 1, n);
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;
}
