#include<bits/stdc++.h>
using namespace std;
// define
#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define se second
#define fi first
#define all(v) (v).begin() , (v).end()
#define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin())
#define bit(x,i) (((x) >> (i)) & 1LL)
#define flip(x,i) ((x) ^ (1LL << (i)))
#define ms(d,x) memset(d , x , sizeof(d))
#define exist __exist
#define ends __ends
#define visit visited
#define left __left
#define right __right
#define prev __prev
#define next __next
#define sitingfake 1
#define orz 1
//constant
const long long mod = 1e9 + 7;
const long long linf = 4557430888798830399LL;
const long long nlinf = -4485090715960753727LL;
const int inf = 1061109567;
const int ninf = -1044266559;
const int dx[] = {0 , -1 , 0 , 1};
const int dy[] = {-1 , 0 , 1 , 0};
template<typename T> bool maximize(T &a, const T &b)
{
if(a < b) {a = b; return 1;}
return 0;
}
template<typename T> bool minimize(T &a, const T &b)
{
if(a > b) {a = b; return 1;}
return 0;
}
void Plus(ll & a ,ll b)
{
b %= mod;
a += b;
if(a < 0) a += mod;
a %= mod;
return;
}
void Mul(ll & a, ll b)
{
(a *= (b % mod)) %= mod;
return;
}
//code
const int maxn = 2e5 + 8;
int l[maxn] , r[maxn] , x[maxn];
int n , q;
namespace subtask4
{
vector <ii> adj[(2500 * 2500) + 2];
int dist[(2500 * 2500) + 2];
int id(int l , int r)
{
return (l - 1) * n + r;
}
void Build()
{
for(int left = 1; left <= n; left++)
{
int Mi = inf , Mx = -inf;
for(int right = left; right <= n; right++)
{
Mi = min(Mi , l[right]);
Mx = max(Mx , r[right]);
int pos = id(left , right);
if(left < right)
{
adj[id(left + 1 , right)].push_back({0 , pos});
adj[id(left , right - 1)].push_back({0 , pos});
adj[id(Mi , right)].push_back({1 , pos});
adj[id(left , Mx)].push_back({1 , pos});
}
else
{
adj[id(Mi , Mx)].push_back({1 , pos});
}
}
}
}
void solve()
{
Build();
ms(dist , 0x3f);
deque <int> dq;
dq.push_back(n);
dist[n] = 0;
while(!dq.empty())
{
int u = dq.front();
dq.pop_front();
for(ii it : adj[u])
{
int v = it.se;
int w = it.fi;
if(minimize(dist[v] , dist[u] + w))
{
if(w)
{
dq.push_back(v);
}
else dq.push_front(v);
}
}
}
for(int i = 1; i <= q; i++)
{
if(dist[id(x[i] , x[i])] == inf)
{
cout << -1 << "\n";
}
else cout << dist[id(x[i] , x[i])] << "\n";
}
}
}
namespace full
{
vector <ii> adj [5 * maxn];
int id[maxn];
int dist[maxn * 5];
int cost1[maxn * 5] , costn[maxn * 5];
void build(int i , int l , int r)
{
if(l == r)
{
id[l] = i;
return;
}
int mid = (r + l) >> 1;
build(i * 2 , l , mid);
build(i * 2 + 1 , mid + 1 , r);
adj[i * 2].push_back({i , 0});
adj[i * 2 + 1].push_back({i , 0});
}
void up(int i , int l , int r , int u , int v , int x)
{
if(u > r || v < l) return;
if(u <= l && r <= v)
{
adj[i].push_back({x , 1});
return;
}
int mid = (r + l) >> 1;
up(i * 2 , l , mid , u , v , x);
up(i * 2 + 1 , mid + 1 , r , u , v , x);
}
void bfs01(int source , int dist[])
{
for(int i = 1; i <= 5 * n; i++) dist[i] = inf;
deque <int> dq;
dq.push_front(id[source]);
dist[id[source]] = 0;
while(!dq.empty())
{
int u = dq.front();
dq.pop_front();
for(ii it : adj[u])
{
int v = it.fi;
int w = it.se;
if(minimize(dist[v] , dist[u] + w))
{
if(w) dq.push_back(v);
else dq.push_front(v);
}
}
}
}
void solve()
{
build(1 , 1 , n);
for(int i = 1; i <= n; i++)
{
up(1 , 1 , n , l[i] , r[i] , id[i]);
}
bfs01(1 , cost1);
bfs01(n , costn);
priority_queue <ii , vector <ii> , greater <ii>> pq;
ms(dist , 0x3f);
for(int i = 1; i <= n; i++)
{
dist[id[i]] = min(inf , cost1[id[i]] + costn[id[i]] - (i != 1 && i != n));
pq.push({dist[id[i]] , id[i]});
}
while(!pq.empty())
{
int u = pq.top().se;
int cost = pq.top().fi;
pq.pop();
if(cost > dist[u]) continue;
for(ii it : adj[u])
{
int v = it.fi;
int w = it.se;
if(minimize(dist[v] , dist[u] + w))
{
pq.push({dist[v] , v});
}
}
}
for(int i = 1; i <= q; i++)
{
if(dist[id[x[i]]] == inf) cout << -1 << "\n";
else cout << dist[id[x[i]]] << "\n";
}
}
}
void solve(void)
{
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> l[i] >> r[i];
}
cin >> q;
for(int i = 1; i <= q; i++)
{
cin >> x[i];
}
if(n <= 2500) subtask4 :: solve();
else full :: solve();
}
/**
**/
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define task ""
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) solve();
// execute;
}
