#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,i,v[1001],a,b,p,m;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
f>>m;
while(m)
{
    f>>a>>b;
    if(a==0){
p=upper_bound(v+1,v+n+1,b)-v;
if(v[p-1]==b)g<<p-1<<'/n';
else g<<-1<<'/n';
    }
    if(a==1){
p=upper_bound(v+1,v+n+1,b)-v;
g<<p-1<<'/n';}
if(a==2){
p=lower_bound(v+1,v+n+1,b)-v;
g<<p;}m--;}
    return 0;
}