#include <bits/stdc++.h>
using namespace std;
#define ll long long

void Warding()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

vector<ll> v;

ll right(ll t)
{
    ll l = 0, r = v.size() - 1, found = -1;
    while (l <= r)
    {
        ll m = l + (r - l) / 2;
        (v[m] <= t ? l = m + 1, found = m + 1 : r = m - 1);
    }
    return found;
}

ll left(ll t)
{
    ll l = 0, r = v.size() - 1, found = 0;
    while (l <= r)
    {
        ll m = l + (r - l) / 2;
        (v[m] >= t ? r = m - 1, found = m + 1 : l = m + 1);
    }
    return found;
}

void solve()
{
    ll l, r;
    cin >> l >> r;
    cout << (right(r) - left(l) + 1 <= v.size() ? right(r) - left(l) + 1 : 0) << " ";
}

int main()
{
    Warding();
    int n;
    cin >> n;
    v.resize(n);
    for (auto &i : v)
        cin >> i;
    sort(v.begin(), v.end());
    int t;
    // t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
}