#include <iostream>
using std::cerr, std::cin, std::cout, std::endl, std::fixed, std::flush;
#include <algorithm>
using std::clamp, std::ranges::count, std::ranges::count_if, std::ranges::fill, std::ranges::find, std::ranges::find_if, std::ranges::is_permutation;
using std::ranges::lower_bound, std::ranges::max, std::ranges::max_element, std::ranges::min, std::ranges::min_element, std::ranges::next_permutation;
using std::ranges::prev_permutation, std::ranges::reverse, std::ranges::rotate, std::ranges::sort, std::ranges::unique, std::ranges::upper_bound;
static_assert(sizeof(long) == 8);
#include <atcoder/segtree>
using namespace atcoder;
int main()
{
  auto op = [](int a, int b)
  {
    return max(a, b);
  };
  auto e = []()
  {
    return -1;
  };
  segtree<long, op, e> st(200000);
  int cnt = 0;
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++)
  {
    int op;
    cin >> op;
    switch (int x, k; op)
    {
    case 1:
      cin >> x;
      st.set(cnt, x);
      cnt++;
      break;
    case 2:
      cin >> k;
      cout << st.prod(cnt - k, cnt) << '\n';
      break;
    }
  }

  return 0;
}
/*
  File : ~/kyopro/yukicoder/554/3198.cpp
  Date : 2025/07/11
  Time : 21:30:16
*/