#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
const char nl = '\n';
const int INF = 1e9;
const ll MOD = 998244353;
void solve(){
int n; cin>>n;
vpi a(n);
F0R(i,n)cin>>a[i].f>>a[i].s;
vi nxt(n,-1);
set<pair<pi,int>> st;
auto check=[](int a, int b, int c, int d)->bool{
return max(a,c) <= min(b,d);
};
F0R(i,n){
if(!st.empty()){
auto it=st.upper_bound({a[i],-1});
if(it!=st.begin())
it=prev(it);
while(next(it)!=st.end() && check(next(it)->f.f, next(it)->f.s,a[i].f,a[i].s)){
nxt[next(it)->s]=i;
st.erase(next(it));
}
while(check(it->f.f,it->f.s, a[i].f,a[i].s)){
nxt[it->s]=i;
if(it==st.begin()){
st.erase(it);
break;
}
it=prev(it);
st.erase(next(it));
}
}
st.insert({a[i],i});
}
F0Rd(i,n-1){
if(nxt[i+1]!=-1) nxt[i]=min(nxt[i],nxt[i+1]);
if(nxt[i]==-1)
nxt[i]=nxt[i+1];
}
vector<vi> nx(20,vi(n,-1));
nx[0]=nxt;
FOR(i,1,20)
F0R(j,n){
if(nx[i-1][j]!=-1)
nx[i][j]=nx[i-1][nx[i-1][j]];
}
int q; cin>>q;
F0R(_,q){
int a, b;
cin>>a>>b; a--,b--;
int ans=1;
F0Rd(i,20){
if(nx[i][a]!=-1&&nx[i][a]<=b){
ans+=1<<i;
a=nx[i][a];
}
}
cout<<ans<<nl;
}
}
int32_t main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int TC = 1;
// cin >> TC;
while(TC--){
solve();
}
return 0;
}
