#include <iostream>
#include <fstream>

using namespace std;



int n,a[100000],m,x,y,i;

int zer(int lo,int hi,int y)
{int mid;
     while(lo<=hi)
     {mid=lo+(hi-lo)/2;
     if(a[mid]<=y)lo=mid+1;
         else hi=mid-1;
     }
     mid=lo+(hi-lo)/2;
     if(a[mid]>y)mid--;
     if(a[mid]==y)return mid;
     return -1;
} 

int one(int lo,int hi,int y)
{
    int mid;
    while(lo<hi)
    {mid=lo+(hi-lo)/2;
    if(a[mid]<=y) lo=mid+1;
                  else hi=m;
    }
    mid=lo+(hi-lo)/2;
    if(a[mid]>y)mid--;
    return mid;
}

int two(int lo,int hi,int y)
{
    int mid;
    while(lo<hi)
    {
                 mid=lo+(hi-lo)/2;
                 if(a[mid]<y)lo=mid+1;
                    else hi=mid;
    }
    mid=lo+(hi-lo)/2;
    if(a[mid]<y)mid++;
    return mid;
}

int main()
{         ifstream f("cautbin.in");
          ofstream g("cautbin.out");
          f>>n;
          for(i=1;i<=n;i++)
                        f>>a[i];
          f>>m;
          while(m--)
          {           x=0;y=0;
                      f>>x>>y;
                      int k;
                      if(x==0) g<<zer(1,n,y)<<endl;
                      if(x==1) g<<one(1,n,y)<<endl;
                      if(x==2) g<<two(1,n,y)<<endl; 
                                   
          }
}