#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define nleft (n<<1)
#define nright (nleft+1)

#include<vector>

using namespace std;
#include<fstream>
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");

#define NMAX 1000000

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

int n,m,i,j,t;
 
using namespace std;
 
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
 
int s[100001];
 
int binary(int val)
{
    int i, step;
    for(step=1;step<n;step<<=1);
     
    for(i=0; step; step>>=1)
        if(i+step<n && s[i+step] <= val)
            i+=step;
    return i;
}
 
int binary2(int val)
{
    int i, step;
    for(step=1;step<n;step<<=1);
     
    for(i=n; step; step>>=1)
        if(i-step >0 && s[i-step] >= val)
            i-=step;
    return i;
}
 
int main() {
    fin>>n;
    for(int i=1; i<=n; ++i)
        fin>>s[i];
     
    fin>>t;
    for(;t>0; --t)
    {
        int a,x,i;
        fin>>a>>x;
        switch(a)
        {
            case 0:
                i=binary(x);
                if(s[i]==x)
                    fout<<i;
                else
                    fout<<-1;
                break;
            case 1:
                i=binary(x);
                fout<<i;
                break;
            case 2:
                i=binary2(x);
                fout<<i;
                break;
        }
        fout<<"\n";
    }
    return 0;
}