#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include<unordered_map>
#include<map>
#include<vector>
#include<set>
//#include<bits/stdc++.h>
#define T int TT;cin>>TT;while (TT--)
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define ref(i,n) for(ll i=n-1;i>=0;i--)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll LNF = 9223372036854775807;
using namespace std;
ll n, m, k, ans, cnt = 1;
typedef pair<ll, ll>tt;
const ll M = 1e5+10;
int main()
{
IOS;
cin>>n;
vector<ll>as;
ll z=0;
while(z<n)
{
z++;
ll x,y;cin>>x>>y;
as.push_back({abs(x)+abs(y)});
}
sort(as.begin(),as.end());
cin>>m;
while(m--)
{
ll L,R;cin>>L>>R;
ll num1=lower_bound(as.begin(),as.end(),L)-as.begin();
ll num2=upper_bound(as.begin(),as.end(),R)-as.begin();
ll ans=(n-num1)-(n-num2);
cout<<ans<<' ';
}
}