#include "atcoder/modint.hpp"
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint1000000007;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

i64 op(i64 a, i64 b) {return max(a, b);}
i64 e() {return 0;}
void _main() {
  i64 q;
  cin >> q;
  i64 now = 0;
  atcoder::segtree<i64, op, e> seg(q);
  while (q--) {
    i64 op, x;
    cin >> op >> x;
    if (op == 1) {
      seg.set(now, x);
      now++;
      continue;
    }
    i64 ans = seg.prod(now - x, now);
    cout << ans << "\n";
  }
}