#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define R return
#define fi first
#define se second
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
const int N=2e5+7;
ll T=1;
void solve()
{
    int n,q;
    cin >> n;
    int a[n+1];
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    sort(a+1,a+n+1);
    cin >> q;
    while(q--){
        int l,r;
        cin >> l >> r;
 
        int lf = lower_bound(a+1,a+n+1,l)-a;
 
        int ri = upper_bound(a+1,a+n+1,r)-a-1;
 
        cout << ri - lf + 1 << ' ' ;
    }
 
}
int main()
{
    ios::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
    //cin>>T;
    while(T--)
        solve();
    R 0;
}
				I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBSIHJldHVybgojZGVmaW5lIGZpIGZpcnN0CiNkZWZpbmUgc2Ugc2Vjb25kCiNkZWZpbmUgeWVzIGNvdXQ8PCJZRVNcbiI7CiNkZWZpbmUgbm8gY291dDw8Ik5PXG4iOwpjb25zdCBpbnQgTj0yZTUrNzsKbGwgVD0xOwp2b2lkIHNvbHZlKCkKewogICAgaW50IG4scTsKICAgIGNpbiA+PiBuOwogICAgaW50IGFbbisxXTsKICAgIGZvcihpbnQgaT0xO2k8PW47aSsrKXsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgIH0KICAgIHNvcnQoYSsxLGErbisxKTsKICAgIGNpbiA+PiBxOwogICAgd2hpbGUocS0tKXsKICAgICAgICBpbnQgbCxyOwogICAgICAgIGNpbiA+PiBsID4+IHI7CgogICAgICAgIGludCBsZiA9IGxvd2VyX2JvdW5kKGErMSxhK24rMSxsKS1hOwoKICAgICAgICBpbnQgcmkgPSB1cHBlcl9ib3VuZChhKzEsYStuKzEsciktYS0xOwoKICAgICAgICBjb3V0IDw8IHJpIC0gbGYgKyAxIDw8ICcgJyA7CiAgICB9Cgp9CmludCBtYWluKCkKewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oTlVMTCk7CiAgICBjaW4udGllKDApOwogICAgY291dC50aWUoMCk7CiAgICAvL2Npbj4+VDsKICAgIHdoaWxlKFQtLSkKICAgICAgICBzb2x2ZSgpOwogICAgUiAwOwp9