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

long v[100001];
long n,m;
int zero (int x,  int u)
{
  int i=1;

    while (( i <= u ) && ( x >= v[i] ))
            i++;
      i = i - 1;
      if (v[i] != x) return -1;
      else return ( i );

}

int unu ( int x, int u)
{
    int i=1;

      while (( i <= u) && (x >= v[i] ))
          i++;
    return (i-1);

}

int doi ( int x, int u)
{
    int i=1;

        while ((i <=u) && (x > v[i]))
         i++;
        return i;
}

int main()
{
    int i,x,y;
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");

    f >> n;
    for (i=1; i<=n; i++)
      f >> v[i];
      f >> m;
      for ( i=1; i<=m; i++ )
          {
              f >> x >> y;
              if (x == 0) g << zero (y, n) << "\n";
              else if (x == 1) g << unu (y, n) << "\n";
              else g << doi ( y,n) << "\n";
          }


    return 0;
}