/*************************************
* author: marvinthang *
* created: 04.07.2023 19:18:29 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
const int MAX = 2e5 + 5;
int N, Q, L[MAX], R[MAX], res[MAX];
void init(void) {
cin >> N;
REP(i, N) cin >> L[i] >> R[i];
}
int cur, left[MAX << 2], right[MAX << 2];
vector <pair <int, int>> adj[MAX << 2];
int build(int l, int r) {
if (r - l == 1) return l;
int m = l + r >> 1;
int p = cur++;
left[p] = build(l, m);
right[p] = build(m, r);
adj[left[p]].emplace_back(0, p);
adj[right[p]].emplace_back(0, p);
return p;
}
void add_edge(int i, int l, int r, int u, int v, int p) {
if (l >= v || r <= u) return;
if (u <= l && r <= v) {
adj[i].emplace_back(1, p);
return;
}
int m = l + r >> 1;
add_edge(left[i], l, m, u, v, p);
add_edge(right[i], m, r, u, v, p);
}
int dist[3][MAX << 2];
void bfs(int t) {
deque <int> q;
vector <vector <int>> cur(N);
REP(i, N) if (dist[t][i] < N) cur[dist[t][i]].push_back(i);
REP(d, N) {
for (int i = 0; i < cur[d].size(); ++i) {
int u = cur[d][i];
if (dist[t][u] != d) continue;
for (auto [w, v]: adj[u]) if (minimize(dist[t][v], dist[t][u] + w) && dist[t][v] < N)
cur[dist[t][v]].push_back(v);
}
}
}
void process(void) {
cur = N;
int r = build(0, N);
REP(i, N) add_edge(r, 0, N, L[i] - 1, R[i], i);
queue <int> q;
REP(i, 3) memset(dist[i], 0x3f, cur * sizeof(int));
dist[0][0] = 0;
bfs(0);
dist[1][N - 1] = 0;
bfs(1);
REP(i, N) dist[2][i] = dist[0][i] + dist[1][i] - (i && i != N - 1);
bfs(2);
cin >> Q;
while (Q--) {
int x; cin >> x; --x;
int res = dist[2][x];
cout << (res > 1e9 ? -1 : res) << '\n';
}
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("passport");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
