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

// 型テンプレ
using ll = long long;
using ull = unsigned long long;

// マクロ

#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()

template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

void printbase() { cout << '\n'; }

template <typename T> void printbase(const T &t) { cout << t << '\n'; }

template <typename T> void printbase(const std::vector<T> &vec) {
  for (const auto &v : vec) {
    cout << v << ' ';
  }
  cout << '\n';
}

template <typename Head, typename... Tail>
void printbase(const Head &head, const Tail &...tail) {
  cout << head << ' ';
  printbase(tail...);
}

#define print(...)                                                             \
  {                                                                            \
    printbase(__VA_ARGS__);                                                    \
    return 0;                                                                  \
  }

const ll INF = (ll)1 << 63;
const string upperlist = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string lowerlist = "abcdefghijklmnopqrstuvwxyz";

ll op(ll a, ll b) { return max(a, b); }

ll e() { return (ll)(0); }

int main() {
  ll Q;
  cin >> Q;

  vector<pair<ll, ll>> L;
  vector<ll> A;

  rep(_, Q) {
    pair<ll, ll> p;
    cin >> p.first >> p.second;

    L.emplace_back(p);

    if (p.first == 1) {
      A.emplace_back(p.second);
    }
  }

  segtree<ll, op, e> seg(A);

  ll cur = 0;

  rep(i, Q) {
    if (L[i].first == 1) {
      cur++;
    } else {
      cout << seg.prod(cur - L[i].second, cur) << "\n";
    }
  }
}