#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n + 1);
  rep(i, n) cin >> a[i + 1];
  int q;
  cin >> q;
  vector<P> qs(q);
  VVI to(n + 1);
  for (int nxt = n + 1; auto& [t, x] : qs) {
    cin >> t;
    if (t == 1) {
      cin >> x;
      to[x].emplace_back(nxt++);
      to.emplace_back();
    } else if (t == 3) {
      cin >> x;
      x--;
    }
  }
  VI ord;
  auto dfs = [&](auto&& self, int u) -> void {
    for (int v : to[u]) self(self, v);
    ord.emplace_back(u);
  };
  rep(i, n) dfs(dfs, a[i+1]);
  dfs(dfs, 0);
  int sz = ord.size();
  VI pos(sz);
  rep(i, sz) pos[ord[i]] = i;
  segtree<int, [](int x, int y) { return x + y; }, []() { return 0; }> seg(sz);
  rep(i, n + 1) seg.set(pos[i], 1);
  int base = 0;
  for (int nxt = n + 1; auto [t, x] : qs) {
    if (t == 1) {
      assert(base <= pos[nxt]);
      seg.set(pos[nxt++], 1);
    } else if (t == 2) {
      assert(seg.get(base));
      base++;
    } else {
      int p = seg.max_right(base, [&](int v) { return v <= x; });
      cout << ord[p] << '\n';
    }
  }
}