// ~~ 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 = 1e8 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int n, leaf[N];
vector<ii> G[N << 2];
void buildGraph(int id, int l, int r) {
if (l == r) {
leaf[l] = id;
return;
}
int mid = (l + r) >> 1;
buildGraph(id << 1, l, mid);
buildGraph(id << 1 | 1, mid + 1, r);
G[id << 1].emplace_back(id, 0);
G[id << 1 | 1].emplace_back(id, 0);
}
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[id].emplace_back(src, 1);
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 dist[2][N << 2], dist_any[N << 2];
void BFS(int u, int dist[]) {
deque<int> q;
FOR(i, 1, 4 * n) dist[i] = inf;
q.pb(leaf[u]);
dist[leaf[u]] = 0;
while(!q.empty()) {
int u = q.front(); q.pop_front();
for(ii x : G[u]) {
int v, w; tie(v, w) = x;
if (minimize(dist[v], dist[u] + w)) {
if (w == 0) q.push_front(v);
else q.pb(v);
}
}
}
}
void dijkstra() {
FOR(i, 1, 4 * n) dist_any[i] = inf;
FOR(i, 1, n) dist_any[leaf[i]] = min(inf, dist[0][leaf[i]] + dist[1][leaf[i]] - (i != 1 && i != n));
priority_queue<ii, vector<ii>, greater<ii>> Q;
FOR(i, 1, n) Q.push(mp(dist_any[leaf[i]], leaf[i]));
while(!Q.empty()) {
int du, u; tie(du, u) = Q.top(); Q.pop();
if (du != dist_any[u]) continue;
for(ii x : G[u]) {
int v, w; tie(v, w) = x;
if (minimize(dist_any[v], dist_any[u] + w))
Q.push(mp(dist_any[v], v));
}
}
}
void init(void) {
cin >> n;
buildGraph(1, 1, n);
FOR(i, 1, n) {
int l, r;
cin >> l >> r;
buildEdge(1, 1, n, l, r, leaf[i]);
}
}
void process(void) {
BFS(1, dist[0]);
BFS(n, dist[1]);
dijkstra();
FOR(i, 1, n) if (dist_any[leaf[i]] > n)
dist_any[leaf[i]] = -1;
int q; cin >> q;
while(q--) {
int x; cin >> x;
cout << dist_any[leaf[x]] << '\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;
}
