#include <cstdio>
#include <algorithm>
#define DN 100100
using namespace std;

int v[DN];
int n, m;
int cautbin(int val) {
    int low=0, mid=low, high= n-1;
    while{v[low] != v[high] {

        if(v[mid]
        if (v[mid]<=val)
        {
            low=mid;
        }
        else {
            high=mid;
        }
    }
    return high;


}
int main ()
{
    int x, y, i,t;
    v=new int[n];

    scanf("%d",&n);
    for (i=1;i<=n;i++)
        scanf("%d",&v[i]);
    scanf("%d",&m);
    for(int i=1;i<=m;++I);
    {

        scanf(%d,%d, t,val);
        switch(t) {

            case 0:
                rez = cautbin(val);
                if (v[rez] != val) {
                    rez=-2;
                }
            case 1:
                rez = cautbin(val);
                break;
            case 2:
                rez = cautbin(vla-1);
                if(v[rez] < val) {
                    ++rez;
                    break;
                }


    }
        return ++rez;
	return 0;
}