#include <bits/stdc++.h>

using namespace std;

ifstream fin ("nums.in");
ofstream fout ("nums.out");

int n, m,k, aib[100002];
string v[100002], s[100002];
int q[100002], viz[100002], nr[100002];

void update (int x) {
  for (int i = x; i <= m; i += (i & -i))
    aib[i]++;
}

int query (int x) {
  int s = 0;
  for (int i = x; i; i -= (i & -i))
    s += aib[i];
  return s;
}
bool cmp (string a, string b) {
  if (a.size() != b.size())
    return a.size() < b.size();
  else
    return a < b;
}

int main()
{
  fin >> n;
  m = 0;
  for (int i = 1; i <= n; i++) {
    int t;
    fin >> t;
    q[i] = t;
    if (t) {
      fin >> v[i];
      s[++m] = v[i];
    }
    else
      fin >> nr[i];
  }
  sort(s + 1,s + m + 1, cmp);
  int m1 = 0;
  unordered_map<string, int>mp;
  for (int i = 1; i <= m; i++)
    if (i == 1 || s[i] != s[i - 1]) {
      s[++m1] = s[i];
      mp[s[m1]] = m1;
    }
  m = m1;
  for (int i = 1; i <= n; i++) {
    if (q[i]) {
      int poz = mp[v[i]];
      if (!viz[poz])
        update(poz);
      viz[poz] = 1;
    }
    else {
      int st = 1, dr = m, ans = -1;
      while (st <= dr) {
        int mij = (st + dr) / 2;
        if (query(mij) >= nr[i]) {
          ans = mij;
          dr = mij - 1;
        }
        else
          st = mij + 1;
      }
      fout << s[ans] << "\n";
    }
  }
  return 0;
}