#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 INF = 1e9;

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  int n;
  cin >> n;
  vector<int> lft(n), rgt(n), mincovered(n, INF);
  vector<vector<int>> segends(n);
  for (int i = 0; i < n; i++){
    cin >> lft[i] >> rgt[i];
    lft[i]--, rgt[i]--;
    segends[rgt[i]].pb(i);
  }
  for (auto& x : segends) sort(all(x));
  vector<vector<int>> dp(n, vector<int>(n, INF));
  dp[0][n - 1] = 0;
  for (int l = 0; l < n; l++){
    dp[l][l] = mincovered[l];
    for (int r = l + 1; r < n; r++){
      dp[l][r] = min({dp[l][r], dp[l][r - 1], mincovered[r]});
    }
    queue<pair<int, int>> q;
    for (int r = n - 1; r >= l; r--){
      if (!q.empty()) dp[l][r] = min(dp[l][r], q.front().se);
      if (!q.empty() && q.front().fi == r) q.pop();
      for (auto i : segends[r]){
        if (lft[i] < l) continue;
        if (lft[i] == l){
          mincovered[i] = min(mincovered[i], dp[l][r] + 1);
        }
        if (q.empty() || i < q.back().fi) q.push({i, dp[l][r] + 1});
      }
    }
  }
  int q;
  cin >> q;
  while (q--){
    int x;
    cin >> x;
    x--;
    cout << (dp[x][x] == INF? -1 : dp[x][x]) << endl;
  }
}