#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

const int N = 2e5 + 20;

vector<pair<int, int>> g[4 * N];
int rep[N];

void build(int v, int tl, int tr){
  if (tl == tr){
    rep[tl] = v;
    return;
  }
  int tm = (tl + tr) / 2;
  g[2 * v + 1].pb({v, 0});
  g[2 * v + 2].pb({v, 0});
  build(2 * v + 1, tl, tm);
  build(2 * v + 2, tm + 1, tr);
}

void decompose(int v, int tl, int tr, int l, int r, int u){
  if (l > r) return;
  if (tl == l && tr == r){
    g[v].pb({u, 1});
    return;
  }
  int tm = (tl + tr) / 2;
  decompose(2 * v + 1, tl, tm, l, min(r, tm), u);
  decompose(2 * v + 2, tm + 1, tr, max(l, tm + 1), r, u);
}

vector<int> dijkstra(vector<int> dist){
  vector<pair<int, int>> q;
  for (int i = 0; i < sz(dist); i++){
    q.pb({dist[i], i});
  }
  sort(all(q));
  reverse(all(q));
  vector<pair<int, int>> nextdist;
  while (!q.empty() || !nextdist.empty()){
    if (!nextdist.empty() && (q.empty() || q.back().fi >= nextdist[0].fi)){
      q.insert(q.end(), nextdist.begin(), nextdist.end());
      nextdist.clear();
    }
    auto [d, v] = q.back();
    q.pop_back();
    if (d != dist[v]) continue;
    for (auto [u, w] : g[v]){
      if (d + w < dist[u]){
        dist[u] = d + w;
        if (dist[u] == d) q.pb({dist[u], u});
        else nextdist.pb({dist[u], u});
      }
    }
  }
  return dist;
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  int n;
  cin >> n;
  build(0, 0, n - 1);
  vector<int> l(n), r(n);
  for (int i = 0; i < n; i++){
    cin >> l[i] >> r[i];
    l[i]--, r[i]--;
    decompose(0, 0, n - 1, l[i], r[i], rep[i]);
  }
  vector<int> reachstart(4 * N, N), reachend(4 * N, N);
  reachstart[rep[0]] = 0, reachend[rep[n - 1]] = 0;
  reachstart = dijkstra(reachstart), reachend = dijkstra(reachend);
  vector<int> dist(4 * N, N);
  for (int i = 0; i < n; i++) dist[rep[i]] = reachstart[rep[i]] + reachend[rep[i]] - (i > 0 && i < n - 1);
  dist = dijkstra(dist);
  int q;
  cin >> q;
  while (q--){
    int x;
    cin >> x;
    x--;
    cout << (dist[rep[x]] == N? -1 : dist[rep[x]]) << endl;
  }
}