#include <bits/stdc++.h>
using namespace std;
int N;
int l[200100],r[200100];
queue<pair<int,int>> q;
int d0[200100];
int dn[200100];
int Q;
struct node{
int s,e,m;
vector<int> v;
node *l,*r;
node(int S, int E){
s = S;
e = E;
m = (s + e)/2;
v = {};
if(s != e){
l = new node(s,m);
r = new node(m + 1, e);
}
}
void update(int S, int E, int k){
if(S <= s && e <= E){
v.push_back(k);
return;
}
if(S <= m){
l -> update(S,E,k);
}
if(m < E){
r -> update(S,E,k);
}
}
void pop(int i, int k){
while(!v.empty()){
q.push({v.back(),k});
v.pop_back();
}
if(s == e) return;
if(i <= m) l -> pop(i,k);
else r -> pop(i,k);
}
}*root;
int main(){
scanf(" %d",&N);
root = new node(0,N-1);
for(int i = 0; i < N; i++){
scanf(" %d",&l[i]);
scanf(" %d",&r[i]);
l[i]--;
r[i]--;
}
for(int i = 0; i < N; i++){
root -> update(l[i],r[i],i);
d0[i] = -1;
}
root -> pop(0,1);
while(!q.empty()){
pair<int,int> ii = q.front();
q.pop();
int i = ii.first;
if(d0[i] != -1) continue;
d0[i] = ii.second;
root -> pop(i,ii.second + 1);
}
root = new node(0,N-1);
for(int i = 0; i < N; i++){
root -> update(l[i],r[i],i);
dn[i] = -1;
}
root -> pop(N - 1, 1);
while(!q.empty()){
pair<int,int> ii = q.front();
q.pop();
int i = ii.first;
if(dn[i] != -1) continue;
dn[i] = ii.second;
root -> pop(i,ii.second + 1);
}
scanf(" %d",&Q);
if(Q == 1){
printf("%d",dn[0]);
}
}
