#include <cstdio>

// min i : a[i] >= x
// answer in [0..n]
int BS( int n, int *a, int x ) {
  int l = -1, r = n; // (l..r]
  while (r - l >= 2) {
    int m = (l + r) / 2;
    if (a[m] >= x)
      r = m;
    else 
      l = m;
  }
  return r;
}

int main() {
  // [L..R]
  cin >> n;
  forn(i, n)
    cin >> a[i];
  sort(a, a + n);

  cin >> q;
  while (q--) {
    cin >> L >> R; // number of x : L <= x <= R
    cout << BS(n, a, R + 1) -
            BS(n, a, L) << endl;
  }
}