#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os<<"{"<<p.ff<<", "<<p.ss<<"}";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (size_t i = 0; i < v.size(); ++i) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
template<ll MOD=998244353>
struct mint_t{
ll x;
mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
mint_t fp(ll y)const{
mint_t a=1,b=x;
while(y){
if(y&1)a*=b;
b*=b;
y/=2;
}
return a;
}
mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
ll x;
in>>x;
a=mint_t<MOD>(x);
return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
out<<a.x;
return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
if(b>a || a<0)return 0;
return fct[a]/fct[b]/fct[a-b];
}
pii sg[POT];
void st(ll v,pii x){
v+=POT/2-1;
sg[v]=x;v/=2;
while(v){
sg[v]=min(sg[v*2],sg[v*2+1]);v/=2;
}
}
pii mn(ll v,ll l,ll r,ll pocz,ll kon){
if(l>kon || r<pocz)return {INFL,INFL};
if(pocz<=l && r<=kon)return sg[v];
return min(mn(v*2,l,(l+r)/2,pocz,kon),mn(v*2+1,(l+r)/2+1,r,pocz,kon));
}
vii g[200007];
ll n,a,b;
ll ds[200007];
ll l[200007],r[200007],lw[200007],pw[200007];
void solve(){
cin>>n;
for(ll i=0;i<n;i++){ds[i]=-1;
cin>>l[i+1]>>r[i+1];
lw[i+1]=pw[i+1]=INFL;
}
ds[n]=-1;
for(ll i=1;i<=n;i++){
ll x=mn(1,1,POT/2,l[i],i-1).ss;
if(x<i){
g[x].pb({i,1});
}
if(l[i]==1)lw[i]=0;
else if(x!=INFL){
lw[i]=lw[x]+1;
}
st(i,{l[i],i});
}
for(ll i=n;i>=1;i--){
ll x=mn(1,1,POT/2,i+1,r[i]).ss;
if(x<=n){
pw[i]=pw[x]+1;
g[x].pb({i,1});
}
if(r[i]==n){
pw[i]=0;
}
else if(x!=INFL){
pw[i]=pw[x]+1;
}
st(i,{-r[i],i});
if(2*n>=lw[i]+pw[i])
g[0].pb({i,lw[i]+pw[i]+1});
}
priority_queue<pii,vii,greater<pii>>pq;
pq.push({0,0});
while(pq.size()){
pii x=pq.top();pq.pop();
if(ds[x.ss]!=-1)continue;
ds[x.ss]=x.ff;
for(pii i : g[x.ss])pq.push({x.ff+i.ss,i.ff});
}
cin>>n;
while(n--){
cin>>a;cout<<ds[a]<<"\n";
}
}
int main(){
fct[0]=1;
for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
