#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out" );
int n,a[100001],i,x,m,tip,val;
int bin_0(int x, int n, int a[])
{

 int m,st=1,dr=n;
 while(st<=dr){ m=st + (dr-st)/2; if(x>a[m]) st=m+1;
    else dr=m-1;
    }

    m=st + (dr-st)/2;
    if (a[m] > x) m --;
    if (a[m] == x)
        return m;
    return -1;

 }
 int bin_1(int x,int n,int a[])
 {

 int m,st=1,dr=n;
 while(st<=dr){ m=st + (dr-st)/2; if(x>a[m]) st=m+1;
    else dr=m-1;
    }
    m=st + (dr-st)/2;
   if (a[m] > x)
       -- m;
    return m;
 }
int bin_2(int x,int n,int a[])
{
    int st=1,dr=n,m;
    while(st<=dr){ m=st + (dr-st)/2;
    if(x>a[m]) st=m+1;
    else dr=m-1;
    }
    m=st + (dr-st)/2;
    if (a[m] < x)
       ++ m;
    return m;}
int main()
{
    f>>n;
    for(i=1;i<=n;i++) f>>a[i];
    f>>m;
    while (m --){
         f>>tip>>val;
          if (tip == 0)
             g<<bin_0(val, n, a)<<endl;
          if (tip == 1)
             g<<bin_1(val, n, a)<<endl;
          if (tip == 2)
              g<<bin_2(val, n, a)<<endl;}
    return 0;
}