#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

template <typename T> class BIT
{
private:
  T e;
  int num;
  std::vector<T> dat;
  T (*eval)(T &, T &) {};
public:
  BIT() : e(0), num(0), dat(std::vector<int>(0)), eval([](int &a, int &b) -> int {return a + b;}){}
  BIT(const BIT<T> &bit) : e(bit.e), num(bit.num), dat(bit.dat), eval(bit.eval){}
  BIT(std::vector<T> &v, T E, T (*func)(T &, T &)) : e(E), eval(func)
  {
    num = static_cast<T>(v.size());
    dat = std::vector<T> (num + 1, e);
    for (int i = 0; i < num; ++i) dat[i + 1] = v[i];
    for (int i = 1; i <= num; ++i)
    {
      int j = i + (i & -i);
      if (j <= num) dat[j] = eval(dat[i], dat[j]);
    }
  }
  BIT(int n, T E, T (*func)(T &, T &)) : e(E), eval(func)
  {
    num = n;
    dat = std::vector<T> (num + 1, e);
  }
  //1-index
  void update(int i, T val) {for (; i <= num; i += i & -i) dat[i] = eval(dat[i], val);}
  //[0,right]
  T getval(int right)
  {
    T ans = e;
    for (; right > 0; right &= right - 1) ans = eval(ans, dat[right]);
    return ans;
  }
  int minright(T val)
  {
    if (val <= 0) return 0;
    int ret = 0, tmp = 1;
    for (int i = num; i > 0; i -= i & -i) tmp = i;
    for (; tmp > 0; tmp >>= 1)
    {
      if (ret + tmp <= num && dat[ret + tmp] < val)
      {
        ret += tmp;
        val -= dat[ret];
      }
    }
    return ret + 1;
  }
}; 

int main()
{
  int n;
  cin >> n;
  vector<int> a(n + 1);
  for (int i = 0; i < n; ++i) cin >> a[i];
  int q, now = n + 1;
  cin >> q;
  vector<vector<int>> c(n + q + 1);
  for (int i = 0; i < n; ++i) c[a[i + 1]].push_back(a[i]);
  vector<int> t(q), x(q);
  for (int i = 0; i < q; ++i)
  {
    cin >> t[i];
    if (t[i] != 2) cin >> x[i];
    if (t[i] == 1) c[x[i]].push_back(now++);
  }
  vector<int> b;
  auto dfs = [&](auto f, int pos) -> void
  {
    for (auto to : c[pos]) f(f, to);
    b.push_back(pos);
  };
  dfs(dfs, 0);
  int siz = b.size();
  BIT<int> bit(siz + 1, 0, [](int &a, int &b) -> int {return a + b;});
  vector<int> id(n + q + 1);
  for (int i = 0; i < siz; ++i) id[b[i]] = i + 1;
  for (int i = 0; i < siz; ++i) if (b[i] <= n) bit.update(i + 1, 1);
  now = n + 1;
  for (int i = 0; i < q; ++i)
  {
    if (t[i] == 1)
    {
      bit.update(id[now++], 1);
    }
    else if (t[i] == 2)
    {
      int tmp = bit.minright(1);
      bit.update(tmp, -1);
    }
    else if (t[i] == 3)
    {
      int tmp = bit.minright(x[i]);
      cout << b[tmp - 1] << endl;
    }
  }
}