#include<bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int inf = 2e9;
vector <pair<int,int>> e[4*N];
deque <int> q;
priority_queue <pair<int,int>> pq;
int dist[4*N][3];
bool vis[4*N];
int tr[N];
int n;
void buildtree(int l,int r,int node){
    if(l == r){
        tr[l] = node;
    }else{
        int mij = (l + r)/2;
        buildtree(l,mij,node*2 + 1);
        buildtree(mij + 1,r,node*2 + 2);
    }
    if(node != 0){
        e[node].push_back({(node - 1)/2,0});
    }
}
void updtree(int ql,int qr,int x,int l = 0,int r = n - 1,int node = 0){
    if(r < ql || qr < l)return;
    if(ql <= l && r <= qr){
        e[node].push_back({tr[x],1});
        //cout<<"edge:"<<node<<' '<<tr[x]<<'\n';
        return;
    }else{
        int mij = (l + r)/2;
        updtree(ql,qr,x,l,mij,node*2 + 1);
        updtree(ql,qr,x,mij + 1,r,node*2 + 2);
    }
}
int main(){
    cin>>n;
    buildtree(0,n - 1,0);
    for(int i = 0;i < n;i++){
        int l1,r1;
        cin>>l1>>r1;
        l1--;r1--;
        updtree(l1,r1,i);
    }
    for(int i = 0;i < 4*n;i++){
        dist[i][0] = -1;
        dist[i][1] = -1;
        dist[i][2] = -1;
    }
    dist[tr[0]][0] = 0;
    q.push_back(tr[0]);
    while(!q.empty()){
        int x = q.front();
        q.pop_front();
        if(vis[x])continue;
        vis[x] = 1;
        for(auto i:e[x]){
            if(dist[i.first][0] == -1 || dist[i.first][0] > dist[x][0] + i.second){
                dist[i.first][0] = dist[x][0] + i.second;
                if(i.second)q.push_back(i.first);
                else q.push_front(i.first);
            }
        }
    }
    for(int i = 0;i < 4*n;i++){
        vis[i] = 0;
    }
    dist[tr[n - 1]][1] = 0;
    q.push_back(tr[n - 1]);
    while(!q.empty()){
        int x = q.front();
        q.pop_front();
        if(vis[x])continue;
        vis[x] = 1;
        for(auto i:e[x]){
            if(dist[i.first][1] == -1 || dist[i.first][1] >= dist[x][1] + i.second){
                dist[i.first][1] = dist[x][1] + i.second;
                if(i.second)q.push_back(i.first);
                else q.push_front(i.first);
            }
        }
    }
    for(int i = 0;i < 4*n;i++){
        dist[i][2] = inf;
    }
    for(int i = 0;i < n;i++){
        if(dist[tr[i]][0] == -1 || dist[tr[i]][1] == -1)continue;
        if(i == 0 || i == n - 1){
            pq.push({-dist[tr[i]][0] - dist[tr[i]][1],tr[i]});
            dist[tr[i]][2] = dist[tr[i]][0] + dist[tr[i]][1];
        }else{
            pq.push({-dist[tr[i]][0] - dist[tr[i]][1] + 1,tr[i]});
            dist[tr[i]][2] = dist[tr[i]][0] + dist[tr[i]][1] - 1;
        }
    }
    while(!pq.empty()){
        int x = -pq.top().first;
        int id = pq.top().second;
        pq.pop();
        //cout<<x<<' '<<id<<'\n';
        if(dist[id][2] != x)continue;
        //cout<<x<<' '<<id<<'\n';
        for(auto i:e[id]){
            if(dist[i.first][2] > dist[id][2] + i.second){
                dist[i.first][2] = dist[id][2] + i.second;
                pq.push({-dist[i.first][2],i.first});
            }
        }
    }

    int q;
    cin>>q;
    for(int i = 0;i < q;i++){
        int x;
        cin>>x;
        x--;
        if(dist[tr[x]][2] == -1){
            cout<<-1<<'\n';
        }else{
            cout<<dist[tr[x]][2]<<'\n';
        }
    }
    return 0;
}