#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int inf = 0x3f3f3f3f;

const int N = 2e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

void cmax(int &a, int b) { a < b ? a = b : 1; }
void cmin(int &a, int b) { a > b ? a = b : 1; }

vector <int> operator + (vector <int> a, vector <int> b) {
  a.insert(a.end(), b.begin(), b.end());
  return a;
}

int n, L[N], R[N], fl[N], fr[N], f[N];
bool tag[N];
queue <int> q;
priority_queue <pair <int, int>> pq;

// int c[N];
// void build() { fill(c, c + N, inf); }
// void modify(int u, int k) { for (; u < N; u += u & -u) cmin(c[u], k); }
// int query(int u) { int res = inf; for (; u; u -= u & -u) cmin(res, c[u]); return res; }

#define ls (u << 1)
#define rs (u << 1 | 1)
#define mid (l + r >> 1)

vector <int> dat[N << 2];

void build(int u = 1, int l = 1, int r = n) {
  if (l == r) return tag[l] = false, dat[u].clear(), void();
  build(ls, l, mid), build(rs, mid + 1, r);
}

void ins(int ml, int mr, int k, int u = 1, int l = 1, int r = n) {
  if (ml <= l && r <= mr) {
    dat[u].emplace_back(k);
    return;
  }
  if (ml <= mid) ins(ml, mr, k, ls, l, mid);
  if (mr > mid) ins(ml, mr, k, rs, mid + 1, r);
}

vector <int> query(int p, int u = 1, int l = 1, int r = n) {
  vector <int> res;
  for (auto it : dat[u]) if (!tag[it]) {
    tag[it] = true, res.emplace_back(it);
  }
  dat[u].clear();
  if (l == r) return res;
  if (p <= mid) res = res + query(p, ls, l, mid);
  else res = res + query(p, rs, mid + 1, r);
  return res;
}

#undef ls
#undef rs
#undef mid

int main() {
  n = read();
  rep(i, 1, n) {
    L[i] = read(), R[i] = read();
    fl[i] = fr[i] = inf;
  }
  build();
  rep(i, 1, n) {
    if (L[i] == 1) fl[i] = 1, q.push(i);
    else ins(L[i], R[i], i);
  }
  while (q.size()) {
    int i = q.front(); q.pop();
    auto id = query(i);
    for (int j : id) fl[j] = fl[i] + 1, q.push(j);
  }
  build();
  rep(i, 1, n) {
    if (R[i] == n) fr[i] = 1, q.push(i);
    else ins(L[i], R[i], i);
  }
  while (q.size()) {
    int i = q.front(); q.pop();
    auto id = query(i);
    for (int j : id) fr[j] = fr[i] + 1, q.push(j);
  }
  rep(i, 1, n) f[i] = fl[i] + fr[i] - 1;
  build();
  rep(i, 1, n) {
    pq.push(make_pair(-f[i], i));
    ins(L[i], R[i], i);
  }
  while (pq.size()) {
    int val = -pq.top().first, i = pq.top().second;
    pq.pop();
    if (val != f[i]) continue;
    auto id = query(i);
    for (int j : id) if (f[i] + 1 < f[j]) {
      f[j] = f[i] + 1, pq.push(make_pair(-f[j], j));
    }
  }
  for (int q = read(); q; -- q) {
    int x = read();
    printf("%d\n", f[x] <= n ? f[x] : -1);
  }
  return 0;
}