#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
int v[100001];
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
    int n,i,j;
    fin>>n;
    for (i=1;i<=n;i++)
    {
        int a;
        fin>>v[i];
    }
    int k;
    fin>>k;
    for (i=1;i<=k;i++)
    {
        long long int a,b;
        fin>>a>>b;
        if (a==0)
        {
            int x=upper_bound(v+1,v+n+1,b)-v-1;
              if (x>=1 && x<=n && v[x]==b)
              {
                  fout<<x<<"\n";
              }
              else
                fout<<-1;
        }
        if (a==1)
        {
            fout<<lower_bound(v+1,v+n+1,b+1)-v-1<<"\n";
        }
        if (a==2)
        {
            fout<<upper_bound(v+1,v+n+1,b-1)-v<<"\n";
        }
    }
    return 0;
}