#include <algorithm>
using namespace std;

#define DIM 100005

int v[DIM];
int n,m;

void read ()
{
    int i;

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

void solve ()
{
    int i,tip,x,poz;

    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d",&tip,&x);
        if (!tip)
        {
            poz=upper_bound (v+1,v+n+1,x)-(v+1);
            if (v[poz]==x)
                printf ("%d\n",poz);
            else
                printf ("-1\n");
        }
        else if (tip==1)
        {
            poz=upper_bound (v+1,v+n+1,x)-(v+1);
            printf ("%d\n",poz);
        }
        else
        {
            poz=lower_bound (v+1,v+n+1,x)-(v+1);
            printf ("%d\n",poz+1);

        }
    }
}

int main ()
{
    freopen ("cautbin.in","r",stdin);
    freopen ("cautbin.out","w",stdout);

    read ();
    solve ();

    return 0;
}