#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;
const int logg = 21;
int n, q;
int L[maxn], R[maxn], x[maxn];
namespace subAC{
vector<pii> adj[6 * maxn];
int d1[6 * maxn], dN[6 * maxn], dX[6 * maxn];
void build(int id, int l, int r){
if(l == r){
adj[l].push_back({n + id, 0});
}
else{
int m = (l + r) / 2;
build(2 * id, l, m);
build(2 * id + 1, m + 1, r);
adj[n + 2 * id].push_back({n + id, 0});
adj[n + 2 * id + 1].push_back({n + id, 0});
}
}
void update(int id, int l, int r, int u, int v, int city){
if(l > v || r < u) return;
if(l >= u && v >= r){
adj[n + id].push_back({city, 1});
}
else{
int m = (l + r) / 2;
update(2 * id, l, m, u, v, city);
update(2 * id + 1, m + 1, r, u, v, city);
}
}
void DJK(int dist[], vector<pair<int, int>> &start){
for(int i = 1; i <= 5 * n; i++) dist[i] = oo;
priority_queue<pii, vector<pii>, greater<pii>> pq;
for(auto[u, w] : start){
dist[u] = w;
pq.push({dist[u], u});
}
while(!pq.empty()){
auto[du, u] = pq.top(); pq.pop();
if(du != dist[u]) continue;
for(auto[v, w] : adj[u]){
if(dist[v] > dist[u] + w){
dist[v] = dist[u] + w;
pq.push({dist[v], v});
}
}
}
}
void Solve(void){
build(1, 1, n);
for(int i = 1; i <= n; i++){
update(1, 1, n, L[i], R[i], i);
}
vector<pii> bucket;
for(int i = 1; i <= n; i++){
if(L[i] == 1) bucket.push_back({i, 1});
}
DJK(d1, bucket);
bucket.clear();
for(int i = 1; i <= n; i++){
if(R[i] == n) bucket.push_back({i, 1});
}
DJK(dN, bucket);
bucket.clear();
for(int i = 1; i <= n; i++){
if(d1[i] != oo && dN[i] != oo) bucket.push_back({i, d1[i] + dN[i] - 1});
}
DJK(dX, bucket);
while(q--){
int x;
cin >> x;
if(dX[x] == oo) dX[x] = -1;
cout << dX[x] << '\n';
}
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen ("tree.inp" , "r" ,stdin);
//freopen ("tree.out" , "w" ,stdout);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> L[i] >> R[i];
}
cin >> q;
subAC :: Solve();
return 0;
}
