#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
vector<pair<ll, ll> > numLive;
ll minSoFar = INF;
for (ll i = 0; i < N; i++) {
if (A[i] < minSoFar) {
minSoFar = A[i];
numLive.push_back({A[i], i});
}
}
ll numSwaps = 0;
ll idx = 0;
ll Q;
cin >> Q;
while (Q--) {
ll Tj;
cin >> Tj;
if (Tj == 1) {
numSwaps++;
if (idx < numLive.size() && numSwaps >= numLive[idx].second) idx++;
} else {
ll Li, Ri;
cin >> Li >> Ri;
cout << numLive[idx].first << endl;
}
}
}
