#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, m, sir[100000];

int cautBin0(int x) {
    int st = 0, dr = n-1, mid, found = false;
    while(st <= dr) {
        mid = st + (dr-st)/2;
        if(x == sir[mid]) {
            found = true;
            break;
        }
        if(sir[mid] > x) {
            dr = mid - 1;
        }
        if(sir[mid] < x) {
            st = mid + 1;
        }
    }
    while(sir[mid] == sir[mid+1]) {
        mid++;
    }
    if(!found) return -1;
    return mid;
}

int cautBin1(int x) {
    int st = 0, dr = n-1, mid, found = false;
    while(st <= dr) {
        mid = st + (dr-st)/2;
        if(x <= sir[mid]) {
            found = true;
            break;
        }
        if(sir[mid] > x) {
            dr = mid - 1;
        }
        if(sir[mid] < x) {
            st = mid + 1;
        }
    }
    while(sir[mid] == sir[mid+1]) {
        mid++;
    }
    if(!found) return -1;
    return mid;
}

int cautBin2(int x) {
    int st = 0, dr = n-1, mid, found = false;
    while(st <= dr) {
        mid = st + (dr-st)/2;
        if(x >= sir[mid]) {
            found = true;
            break;
        }
        if(sir[mid] > x) {
            dr = mid - 1;
        }
        if(sir[mid] < x) {
            st = mid + 1;
        }
    }
    while(sir[mid] == sir[mid-1]) {
        mid--;
    }
    if(!found) return -1;
    return mid;
}

int main() {
    f>>n;
    for(int i = 0; i < n; i++) {
        f>>sir[i];
    }
    f>>m;
    int queryType, queryNumber;
    for(int i = 0; i < m; i++) {
        f>>queryType>>queryNumber;
        if(queryType == 0) g<<cautBin0(queryNumber) + 1<<'\n';
        else if(queryType == 1) g<<cautBin1(queryNumber) + 1<<'\n';
        else g<<cautBin2(queryNumber) + 1<<'\n';
    }
}