#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define popcount __builtin_popcount
#define all(a) (a).begin(), (a).end()
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q; cin >> n;
int pref[n]; cin >> pref[0];
for (int i = 1; i < n; i++) {
cin >> pref[i];
pref[i] = min(pref[i], pref[i-1]);
}
int k = 0;
cin >> q; while (q--) {
int t, l, r; cin >> t;
if (t == 1) k++;
else {
cin >> l >> r;
cout << pref[min(n-1, k)] << "\n";
}
}
}
