#include <stdlib.h>
#define N 100010
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,v[N];
int solve0(int val)
{   int i;
    for(i=1;i<=n && v[i]<val;++i);
    if(v[i]==val)  return i;
    return -1;
}
int solve1(int val)
{   int i;
    for(i=1;i<=n && v[i]<=val;++i);
    return i-1;
}
int solve2(int val)
{   int i;
    for(i=1;i<=n && v[i]<val;++i);
    return i;
}
int main()
{   int i,m,val,tip;
    f>>n;
    for (i=1;i<=n;++i) f>>v[i];
    f>>m;
    while(m--)
    {   f>>tip>>val;
        if(tip==0) g<<solve0(val)<<'\n';
        if(tip==1) g<<solve1(val)<<'\n';
        if(tip==2) g<<solve2(val)<<'\n';
    }
    return 0;
}