#include <fstream>

using namespace std;

int n, q, tip, x, a[1000], p, u , m;

int bs0 (int x) {
  p = 1, u = n;
  while (p <= u) {
    m = (p+u)/2;
    if (a[m] <= x)
      p = m+1;
    else
      u = m-1;
  }
  m = (p+u)/2;
  if (a[m] > x)
    m--;
  if (a[m] == x)
    return m;
  return -1;
}

int bs1 (int x) {
  p = 1, u = n;
  while (p < u) {
    m = (p+u)/2;
    if (a[m] <= x)
      p = m+1;
    else
      u = m;
  }
  m = (p+u)/2;
  if (a[m] > x)
    m--;
  return m;
}

int bs2 (int x) {
  p = 1, u = n;
  while (p < u) {
    m = (p+u)/2;
    if (a[m] < x)
      p = m+1;
    else
      u = m;
  }
  m = (p+u)/2;
  if (a[m] < x)
    m++;
  return m;
}

int main () {
  ifstream fi("cautbin.in");
  ofstream fo("cautbin.out");
  fi >> n;
  for (int i = 1; i <= n; i++)
    fi >> a[i];
  fi >> q;
  for (int i = 1; i <= q; i++) {
    fi >> tip >> x;
    if (tip == 0)
      fo << bs0(x) << '\n';
    else
      if (tip == 1)
        fo << bs1(x) << '\n';
      else
        fo << bs2(x) << '\n';
  }
  return 0;
}