/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 2e5 + 5;
const int INF = (int)1e9 + 5;
int n, L[MAXN], R[MAXN], q, pos[MAXN];
int dist1[4 * MAXN], distn[4 * MAXN], ans[4 * MAXN];
vector<pii> graph[4 * MAXN];
void init() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> L[i] >> R[i];
for (int i = 0; i < 4 * MAXN; ++i) {
dist1[i] = INF;
distn[i] = INF;
ans[i] = INF;
}
}
void build(int id, int l, int r) {
if (l == r) {
pos[l] = id;
return;
}
int mid = (l + r) >> 1;
int left = (id << 1);
int right = ((id << 1) | 1);
graph[left].push_back({id, 0});
graph[right].push_back({id, 0});
build(left, l, mid);
build(right, mid + 1, r);
}
void getNodes(int id, int l, int r, int u, int v, vector<int> &nodes) {
if (r < u || v < l) return;
if (u <= l && r <= v) {
nodes.push_back(id);
return;
}
int mid = (l + r) >> 1;
getNodes(id << 1, l, mid, u, v, nodes);
getNodes(id << 1 | 1, mid + 1, r, u, v, nodes);
}
void getNodes(int u, int v, vector<int> &nodes) {
getNodes(1, 1, n, u, v, nodes);
}
void dijkstra(int source, int dist[]) {
dist[source] = 0;
priority_queue<pii, vector<pii>, greater<pii>> pq;
pq.push({0, source});
while (SZ(pq)) {
int cost = pq.top().fi, u = pq.top().se;
pq.pop();
if (dist[u] < cost) continue;
for (auto &e : graph[u]) {
int v = e.fi, w = e.se;
if (minimize(dist[v], dist[u] + w)) {
pq.push({dist[v], v});
}
}
}
}
void solve() {
build(1, 1, n);
vector<int> nodes;
for (int i = 1; i <= n; ++i) {
nodes.clear();
getNodes(L[i], R[i], nodes);
for (auto u : nodes)
graph[u].push_back({pos[i], 1});
}
dijkstra(pos[1], dist1);
dijkstra(pos[n], distn);
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int i = 1; i <= n; ++i) {
if (dist1[pos[i]] == INF || distn[pos[i]] == INF) continue;
int cost = dist1[pos[i]] + distn[pos[i]];
if (i != 1 && i != n) cost--;
ans[pos[i]] = cost;
pq.push({ans[pos[i]], pos[i]});
}
while (SZ(pq)) {
int cost = pq.top().fi, u = pq.top().se;
pq.pop();
if (ans[u] < cost) continue;
for (auto &e : graph[u]) {
int v = e.fi, w = e.se;
if (minimize(ans[v], ans[u] + w)) {
pq.push({ans[v], v});
}
}
}
cin >> q;
while (q--) {
int x; cin >> x;
cout << (ans[pos[x]] == INF ? -1 : ans[pos[x]]) << '\n';
}
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
