//Im namen Gottes
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN=1e5+1e3;
int n;
int array[MAXN];

int le(int x)
{
  if(x<=array[1])
    return 0;
  int up=n,down=1;
  while(up>=down)
    {
      int mid=(up+down)/2;
      if(array[mid]>=x)
	up=mid-1;
      else{
	//le[mid]<x
	if(mid==n or array[mid+1]>=x)
	  return mid;
	down=mid+1;
      }//else
    }//while
  return 0;
}

int leq(int x)
{
  if(x<array[1])
    return 0;
  int up=n,down=1;
  while(up>=down)
    {
      int mid=(up+down)/2;
      if(array[mid]>x)
	up=mid-1;
      else{
	//le[mid]<=x
	if(mid==n or array[mid+1]>x)
	  return mid;
	down=mid+1;
      }//else
    }//while
  return 0;
}

int range(int a,int b)
{
  return leq(b)-le(a);
}

int main()
{
  cin>>n;
  for(int i=1;i<=n;++i)
    cin>>array[i];
  sort(array+1,array+n+1);
  int m=n;
  while(m--)
    {
      int a,b;
      cin>>a>>b;
      cout<<range(a,b)<<endl;
    }
  return 0;
}