#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001],n,m,x,y;
int cautbin0(int x)
{
    int st=1, dr=n,mij,p=-1;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]==x)
            p=mij, st=mij+1;
        else if(v[mij]<x) st=mij+1;
        else dr=mij-1;
    }
    return p;
}
int cautbin1(int x)
{
    int st=1, dr=n, mij,p=0;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<=x)
            p=mij, st=mij+1;
        else dr=mij-1;
    }
    return p;
}
int cautbin2(int x)
{
    int st=1, dr=n, mij,p=0;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]>=x)
            p=mij, dr=mij-1;
        else st=mij+1;
    }
    return p;
}

int main()
{
  in>>n;
  for(int i=1; i<=n; i++)
    in>>v[i];
  in>>m;
  for(int i=1; i<=m; i++)
  {
      in>>x>>y;
      if(x==0)
        out<<cautbin0(y)<<endl;
     else if(x==1)
        out<<cautbin1(y)<<endl;
     else if(x==2)
        out<<cautbin2(y)<<endl;
  }

}