#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; }

int n, L[N], R[N], id[N], fl[N], fr[N], f[N];

// 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)

int dat[N << 2];

void maintain(int u) {
  dat[u] = min(dat[ls], dat[rs]);
}

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

void modify(int p, int k, int u = 1, int l = 1, int r = n) {
  if (l == r) return dat[u] = k, void();
  if (p <= mid) modify(p, k, ls, l, mid);
  else modify(p, k, rs, mid + 1, r);
  maintain(u);
}

int query(int ql, int qr, int u = 1, int l = 1, int r = n) {
  if (ql <= l && r <= qr) return dat[u];
  int res = inf;
  if (ql <= mid) cmin(res, query(ql, qr, ls, l, mid));
  if (qr > mid) cmin(res, query(ql, qr, 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(), id[i] = i;
  sort(id + 1, id + n + 1, [&](int i, int j) {
    return L[i] == L[j] ? R[i] < R[j] : L[i] < L[j];
  });
  fill(fl + 1, fl + n + 1, inf);
  build();
  rep(_i, 1, n) {
    int i = id[_i];
    fl[i] = L[i] == 1 ? 1 : query(L[i], R[i]) + 1;
    modify(i, fl[i]);
  }
  sort(id + 1, id + n + 1, [&](int i, int j) {
    return R[i] == R[j] ? L[i] > L[j] : R[i] > R[j];
  });
  fill(fr + 1, fr + n + 1, inf);
  build();
  rep(_i, 1, n) {
    int i = id[_i];
    fr[i] = R[i] == n ? 1 : query(L[i], R[i]) + 1;
    modify(i, fr[i]);
  }
  rep(i, 1, n) f[i] = fl[i] + fr[i] - 1;
  sort(id + 1, id + n + 1, [&](int i, int j) {
    return L[i] == L[j] ? R[i] < R[j] : L[i] < L[j];
  });
  build();
  rep(_i, 1, n) {
    int i = id[_i];
    cmin(f[i], query(L[i], R[i]) + 1);
    modify(i, f[i]);
  }
  sort(id + 1, id + n + 1, [&](int i, int j) {
    return R[i] == R[j] ? L[i] > L[j] : R[i] > R[j];
  });
  build();
  rep(_i, 1, n) {
    int i = id[_i];
    cmin(f[i], query(L[i], R[i]) + 1);
    modify(i, f[i]);
  }
  for (int q = read(); q; -- q) {
    int x = read();
    printf("%d\n", f[x] <= n ? f[x] : -1);
  }
  return 0;
}