#include<bits/stdc++.h>
using namespace std;
int s[10000001];int a[1000111],n;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+1+n);
    int m;
    cin>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        if(x>y){
        	swap(x,y);
        }
        
        int t1=lower_bound(a+1,a+1+n,x)-a,t2=upper_bound(a+1,a+1+n,y)-a-1;
        if(t2==n+1){
        	cout<<0<<"\n";
        }
        else cout<<t2-t1+1<<"\n";
    }
    return 0;
}