#include <bits/stdc++.h>
using namespace std;
main(){
int n , m; cin >> n ;
int arr[n] ;
for (int i =0 ; i < n ; i++)cin >> arr[i] ;
sort (arr, arr+n) ;
cin >> m ;
while (m--){
int l , r ; cin >> l >> r ;
int left =-1 , right = n ;
while (left + 1 < right)
{
int mid = (left + right ) /2 ;
if (arr[mid] >= l ) right = mid ;
else left = mid ;
}
int st = right ;
left =0 , right = n ;
while (left + 1 < right)
{
int mid = (left + right ) /2 ;
if (arr[mid] <= r ) left = mid ;
else right = mid ;
}
if (l<0 && r < 0 ) cout << left - st ;
else
cout << left - st +1 ;
if (m) cout << " ";
}
//
// 5
//10 1 10 3 4
//4
//1 10
//2 9
//3 4
//2 2
cout << endl;
return 0 ;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKCm1haW4oKXsKCWludCBuICwgbTsgY2luID4+IG4gOwoJaW50IGFycltuXSA7Cglmb3IgKGludCBpID0wIDsgaSA8IG4gOyBpKyspY2luID4+IGFycltpXSA7Cglzb3J0IChhcnIsIGFycituKSA7CgljaW4gPj4gbSA7Cgl3aGlsZSAobS0tKXsKCQkJaW50IGwgICwgciA7IGNpbiA+PiBsID4+IHIgOwoKCQlpbnQgbGVmdCA9LTEgLCByaWdodCA9IG4gIDsKCgkJd2hpbGUgKGxlZnQgKyAxIDwgcmlnaHQpCgkJewoJCQlpbnQgbWlkID0gKGxlZnQgKyByaWdodCApIC8yIDsKCgkJCWlmIChhcnJbbWlkXSA+PSBsICkgcmlnaHQgPSBtaWQgIDsKCQkJZWxzZSBsZWZ0ID0gbWlkICA7CgoJCSB9CgoKCQkgaW50IHN0ID0gcmlnaHQgOwoKCQkgbGVmdCA9MCAsIHJpZ2h0ID0gbiAgOwoKCQl3aGlsZSAobGVmdCArIDEgPCByaWdodCkKCQl7CgkJCWludCBtaWQgPSAobGVmdCArIHJpZ2h0ICkgLzIgOwoKCQkJaWYgKGFyclttaWRdIDw9IHIgKSBsZWZ0ICA9IG1pZCAgOwoJCQllbHNlIHJpZ2h0ICA9IG1pZCAgOwoKCQkgfQoKICAgICAgICBpZiAobDwwICYmIHIgPCAwICkgY291dCA8PCBsZWZ0IC0gc3QgOwogICAgICAgIGVsc2UKCQkgY291dCA8PCBsZWZ0IC0gc3QgKzEgIDsKCQkgICAgaWYgKG0pIGNvdXQgPDwgIiAiOwoJfQovLwovLwk1Ci8vMTAgMSAxMCAzIDQKLy80Ci8vMSAxMAovLzIgOQovLzMgNAovLzIgMgoKICAgY291dCA8PCBlbmRsOwoJcmV0dXJuIDAgOwp9Cg==