#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

const int maxn = 1e5+2;
int n, v[maxn], q, tip, x;

int solve0()
{
    int res=-1, st=1, dr=n;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(v[mid]==x)
        {
            res=mid;
            st=mid+1;
        }
        else if(v[mid]<x)
        {
            st=mid+1;
        }
        else
        {
            dr=mid-1;
        }
    }
    return res;
}

int solve1()
{
    int res=1, st=1, dr=n;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(v[mid]<=x)
        {
            res=mid;
            st=mid+1;
        }
        else
        {
            dr=mid-1;
        }
    }
    return res;
}

int solve2()
{
    int res=n, st=1, dr=n;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(v[mid]>=x)
        {
            res=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    return res;
}

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
    }
    fin>>q;
    while(q--)
    {
        fin>>tip>>x;
        if(tip==0)
        {
            fout<<solve0()<<'\n';
        }
        else if(tip==1)
        {
            fout<<solve1()<<'\n';
        }
        else
        {
            fout<<solve2()<<'\n';
        }
    }
    return 0;
}