#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
//const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
//const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    ll B=800;
    vector<deque<ll>> g(B);
    vl order(610000);
    rep(i,n){
        ll a;cin >> a;a--;
        order[a]=i/B;
        g[i/B].push_back(a);
    }
    ll q;cin >> q;
    queue<ll> que;
    rep(i,q)que.push(n+i);
    ll lt=(n/B);
    auto reform=[&]() -> void {
        queue<ll> que;
        rep(i,B){
            while(g[i].size()){
                que.push(g[i].front());
                g[i].pop_front();
            }
        }
        lt=que.size()/B;
        rep(i,B){
            while(que.size()&&g[i].size()<B){
                order[que.front()]=i;
                g[i].push_back(que.front());
                que.pop();
            }
        }
    };
    while(q--){
        ll t;cin >> t;
        if(t==1){
            ll a;cin >> a;a--;
            ll x=que.front();que.pop();
            if(a==-1){
                g[lt].push_back(x);
                order[x]=lt;
                if(g[lt].size()>=B*2){
                    reform();
                }
            }
            else{
                ll id=order[a];
                order[x]=id;
                stack<ll> st;
                while(g[id].front()!=a){
                    st.push(g[id].front());g[id].pop_front();
                }
                g[id].push_front(x);
                while(st.size()){
                    g[id].push_front(st.top());st.pop();
                }
                if(g[id].size()>=2*B){
                    reform();
                }
            }
        }
        else if(t==2){
            rep(i,B){
                if(g[i].size()==0)continue;
                g[i].pop_front();
                break;
            }
        }
        else {
            ll k;cin >> k;k--;
            rep(i,B){
                if(g[i].size()<=k){
                    k-=g[i].size();
                }
                else{
                    cout << g[i][k]+1 << endl;
                    break;
                }
            }
        }
    }
}