#include <iostream>
#include <algorithm>
using namespace std;

const long long int max_n=1e5+200;
long long int input[max_n];
int result[max_n];


int binarysearch(long long int input[],int n,int beg)
{
  if(input[1]>=beg)
    return 0;
  int up,down;
  down=1;
  up=n;
  long long mid;
  while (down<=up)
  {
    mid=(up+down)/2;
    if(input[mid]>=beg)
      up=mid-1;
    else
    {
      if(mid==n or input[mid+1]>=beg)
	return mid;
      down=mid+1;
    }
  }
  return 0;
}

int main()
{
	long long int n;
	cin>>n;
	
	for (int i=1;i<=n;i++)
	  cin>>input[i];
	
	sort(input+1,input+n+1);
	for(int i=1;i<=n;++i){
	  int beg,end;
       	cin>>beg>>end;
int b,e;
	   b=binarysearch(input,n,beg);
	   e=binarysearch(input,n,end+1);
	   
	   cout<<e-b<<endl;
	  
	}

	
	return 0;
}