#include <cstdio>
#define N 100000
using namespace std;
int n;
int m;
int a[N];

int funcA(int y)
{
    int st = 1;
    int dr = n;
    int mij = (st+dr)/2;

    while(dr - st > 1)
    {
        if(y >= a[mij])
        st = mij;
        else
        dr = mij;

        mij = (st + dr)/2;
    }

    if(a[st] == y)
        return st;
    else
        if(a[dr] == y)
            return dr;
        else
            return -1;
}

int funcB(int y)
{
    int st = 1;
    int dr = n;
    int mij = (st+dr)/2;

    while(dr - st > 1)
    {
        if(y >= a[mij])
        st = mij;
        else
        dr = mij;

        mij = (st + dr)/2;
    }

    if(a[dr] <= y)
        return dr;
        return st;
}

int funcC(int y)
{
    int st = 1;
    int dr = n;
    int mij = (st+dr)/2;

    while(dr - st > 1)
    {
        if(y > a[mij])
        st = mij;
        else
        dr = mij;

        mij = (st + dr)/2;
    }

    if(a[st] >= y)
        return st;
        return dr;
}


int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1 ; i <= n ; i++)
    {
        scanf("%d",&a[i]);
    }

    scanf("%d",&m);
    for(int i = 0 ; i < m ; i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);

        if(x == 0)
        {
            printf("%d\n",funcA(y));
        }
        else
        if(x == 1)
        {
            printf("%d\n",funcB(y));
        }
        else
        if(x == 2)
        {
            printf("%d\n",funcC(y));
        }

    }
    return 0;
}