#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,v[1000001],i,k,j,nr,Max,c,t,s;
float a,Min,x;
int main()
{f>>n;
for (i=1;i<=n;i++)
f>>v[i];
f>>m;
for (i=1;i<=m;i++)
{f>>t>>x;
  if (t==0)
        {k=upper_bound(v+1,v+n+1,x)-v-1;
  if (k<=n && k>=1) g<<k<<'\n';
  else g<<"-1"<<'\n';}
  else if (t==1)
  {k=lower_bound(v+1,v+n+1,x+1)-v-1;
  g<<k<<'\n';}
  else {k=upper_bound(v+1,v+n+1,x-1)-v;
  g<<k<<'\n';}

  }

    return 0;
}