// ~~ 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 "gen"
/*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;
vector<int> G[N], rG[N];
int dist[2][N], dist_any[N];
void BFS(int src, int dist[], const vector<int> *G) {
queue<int> q;
FOR(i, 1, n) dist[i] = inf;
q.push(src);
dist[src] = 0;
while(!q.empty()) {
int u = q.front(); q.pop();
for(int v : G[u]) if (minimize(dist[v], dist[u] + 1))
q.push(v);
}
}
void init(void) {
cin >> n;
FOR(i, 1, n) {
int l, r;
cin >> l >> r;
FOR(j, l, r) G[i].pb(j), rG[j].pb(i);
}
}
void process(void) {
BFS(1, dist[0], rG);
BFS(n, dist[1], rG);
int q; cin >> q;
while(q--) {
int u; cin >> u;
BFS(u, dist_any, G);
int ans = inf;
FOR(i, 1, n) minimize(ans, min(inf, dist[0][i] + dist[1][i] + dist_any[i] - (i != 1 && i != n)));
cout << (ans == inf ? -1 : ans) << '\n';
cerr << (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;
}
