#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7,inf=1e9;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,l[N],r[N],query,dp[301][301][301];
bool M2;
void solve(){
cin >> node;
for(int i=1;i<=node;++i)cin >> l[i] >> r[i];
cin >> query;
while(query--){
int i;
cin >> i;
for(int i=1;i<=node;++i)
for(int j=1;j<=node;++j)
for(int k=1;k<=node;++k)dp[i][j][k]=inf;
dp[i][l[i]][r[i]]=1;
deque<array<int,3>>p;
p.push_front({i,l[i],r[i]});
while(!p.empty()){
array<int,3>x=p.front();
p.pop_front();
if(x[0]-1>=x[1]){
if(dp[x[0]-1][x[1]][x[2]]>dp[x[0]][x[1]][x[2]]){
dp[x[0]-1][x[1]][x[2]]=dp[x[0]][x[1]][x[2]];
p.push_front({x[0]-1,x[1],x[2]});
}
}
if(x[0]+1<=x[2]){
if(dp[x[0]+1][x[1]][x[2]]>dp[x[0]][x[1]][x[2]]){
dp[x[0]+1][x[1]][x[2]]=dp[x[0]][x[1]][x[2]];
p.push_front({x[0]+1,x[1],x[2]});
}
}
if(dp[x[0]][min(l[x[0]],x[1])][max(r[x[0]],x[2])]>dp[x[0]][x[1]][x[2]]+1){
dp[x[0]][min(l[x[0]],x[1])][max(r[x[0]],x[2])]=dp[x[0]][x[1]][x[2]]+1;
p.pb({x[0],min(l[x[0]],x[1]),max(r[x[0]],x[2])});
}
}
int ans=inf;
for(int i=1;i<=node;++i){
ans=min(ans,dp[i][1][node]);
}
if(ans==inf)ans=-1;
cout<<ans<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}
