#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

int a[100001];

int binarySearch0(int low, int high, int x)
{
    int middle;
    while(low<=high)
    {
        middle=low+(high-low)/2;
        if(a[middle]<=x) low = middle + 1;
        else high=middle-1;
    }
    middle=low+(high-low)/2;
    if(a[middle]>x) middle--;
    if(a[middle]==x)
        return middle;
    return -1;
}

int binarySearch1(int low, int high, int x)
{
    int middle, n=high;
    while(low<high)
    {
        middle=low+(high-low)/2;
        if(a[middle]<=x) low=middle+1;
        else high=middle;
    }
    middle=low+(high-low)/2;
    if(a[middle]>x) middle--;
    return middle;
}

int binarySearch2(int low, int high, int x) {
    int middle;
    while(low<high)
    {
        middle=low+(high-low)/2;
        if (a[middle]<x)
            low=middle+1;
        else
            high=middle;
    }
    middle=low+(high-low)/2;
    if(a[middle]<x) middle++;
    return middle;
}

int main()
{
    int i, n, m, type, x;
    f>>n;
    for(i=1; i<=n; i++)
        f>>a[i];
    f>>m;
    while(m!=0){
        f>>type>>x;
        if(type==0) g<<binarySearch0(1,n,x)<<'\n';
        if(type==1) g<<binarySearch1(1,n,x)<<'\n';
        if(type==2) g<<binarySearch2(1,n,x)<<'\n';
        m--;
    }
    return 0;
}