#include <bits/stdc++.h>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,m,a[100100],q,x,p;
int main()
{
   in>>n;
   for(int i=1;i<=n;i++) in>>a[i];
   in>>m;
   while(m--)
   {
       in>>q>>x;
       if(q==0)
       {
          p=lower_bound(a+1,a+n+1,x+1)-a-1;
          if(a[p]==x) out<<p<<'\n';
          else out<<-1<<'\n';
       }
       else if(q==1)
       {
           p=upper_bound(a+1,a+n+1,x)-a-1;
           out<<p<<'\n';
       }
       else
       {
           p=lower_bound(a+1,a+n+1,x)-a;
           out<<p<<'\n';
       }
   }
}