#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
//#include <iostream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int bsearch0(int n, int x[], int element, int st, int dr)
{
    int val = -1;
    while(st <= dr)
    {
        int m = (st + dr) / 2;
        if(x[m] == element)
            val = m;
        if(x[m] <= element)
            st = m + 1;
        else
            dr = m - 1;
    }
    if(val != -1)
        return val + 1;
    return -1;
}
int bsearch1(int n, int x[], int element, int st, int dr)
{
    int val = -1, cst = st, cdr = dr;
    while(st <= dr)
    {
        int m = (st + dr) / 2;
        if(x[m] == element)
            val = m;
        if(x[m] <= element)
            st = m + 1;
        else
            dr = m - 1;
    }
    if(val != -1)
        return val + 1;
    return bsearch1(n, x, x[st - 1], cst, cdr);
}
int bsearch2(int n, int x[], int element, int st, int dr)
{
    int val = -1, cst = st, cdr = dr;
    while(st <= dr)
    {
        int m = (st + dr) / 2;
        if(x[m] == element)
            val = m;
        if(x[m] >= element)
              dr = m - 1;
        else
            st = m + 1;
    }
    if(val != -1)
        return val + 1;
    return bsearch2(n, x, x[st], cst, cdr);
}
int main(){
    int n, m, x[100004];
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> x[i];
    cin >> m;
    int a, b;
    for(int i = 0; i < m; i++)
    {
        cin >> a >> b;
        if(a == 0)
            cout << bsearch0(n, x, b, 0, n - 1) << "\n";
        if(a == 1)
            cout << bsearch1(n, x, b, 0, n - 1) << "\n";
        if(a == 2)
            cout << bsearch2(n, x, b, 0, n - 1) << "\n";
    }
    return 0;
}