program binar;

type
vector=array[1..100000] of word;
var
n,m,i,j,x,k,li,ls:integer;
a:vector;
f,g:text;
b:0..2;
af:boolean;
begin

assign(f,'cautbin.in');
reset(f);
readln(f,n);
for i:=1 to n do read(f,a[i]);
readln(f,m);
assign(g,'cautbin.out');
rewrite(g);
for j:=1 to m do
              begin
              readln(f,b,x);
              li:=1;
              ls:=n;
              case b of
                     0:begin
                       af:=false;
                       while (af=false) do
                       begin
                         k:=(ls+li) div 2;
                         if ((a[k]=x) and (a[k+1]>x)) then
                                          begin
                                          writeln(g,k);
                                          af:=true;
                                          end
                         else li:=k+1;
                         if (a[k]>x) then ls:=k-1;
                         if ((ls=li) and (x<>a[ls])) then begin
                                                          af:=true;
                                                          writeln(g,-1);
                                                          end;
                       end;
                       end;

                       1:begin
                         af:=false;
                         while (af=false) do
                                begin
                                if ((a[k]>=x) and (a[k+1]>x)) then begin
                                                                      writeln(g,k);
                                                                      af:=true;
                                                                   end;
                                if (a[k]<x) then li:=k+1
                                                 else ls:=k-1;
                                end;
                         end;
                      2: begin
                         af:=false;
                         while(af=false) do
                                       begin
                                       k:=(ls+li) div 2;
                                       if ((a[k]>=x) and (a[k-1]<x)) then begin
                                                                           writeln(g,k);
                                                                           af:=true;
                                                                           end;
                                       if (a[k]<x) then li:=k+1
                                                   else ls:=k-1;
                                       end;
                         end;
              end;
              end;

close(f);
close(g);
end.