#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}
size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
//#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#endif
typedef long long ll;
#define pi pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void solve() {
//ifstream cin("nazwa.in");
//ofstream cout("nazwa.out");
int n;
cin >> n;
vi L(n + 1), R(n + 1);
for(int i = 1; i <= n; i++) {
cin >> L[i] >> R[i];
}
int r = n;
int lg = 0;
while((1 << (lg + 1)) < n) {
lg++;
}
vector<vi>nxt(n + 2, vi(lg + 1, n + 1));
set<int>s_poc, s_kon;
for(int i = n; i >= 1; i--) {
while(r > i) {
auto it = s_poc.lower_bound(L[i]);
if(it != s_poc.end() && (*it) <= R[i]) {
s_poc.erase(L[r]);
s_kon.erase(R[r]);
r--;
continue;
}
auto it2 = s_kon.upper_bound(R[i]);
if(it2 != s_kon.begin()) {
it2--;
if((*it2) >= L[i]) {
s_poc.erase(L[r]);
s_kon.erase(R[r]);
r--;
continue;
}
}
break;
}
debug(i, r);
nxt[i][0] = r + 1;
s_poc.insert(L[i]);
s_kon.insert(R[i]);
}
for(int i = 1; i <= lg; i++) {
for(int j = 1; j <= n; j++) {
nxt[j][i] = nxt[nxt[j][i - 1]][i - 1];
}
}
int t;
cin >> t;
while(t--) {
int l, r;
cin >> l >> r;
int ans = 0;
for(int i = lg; i >= 0; i--) {
if(nxt[l][i] <= r) {
debug(l, (1 << i), nxt[l][i]);
ans += (1 << i);
l = nxt[l][i];
}
}
ans++;
cout << ans << '\n';
}
}
int main() {
fastio();
int t = 1;
//cin >> t;
while(t--) {
solve();
}
}
