#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

using Tree = tree<pair<int, string>, null_type, less<pair<int, string>>, rb_tree_tag, tree_order_statistics_node_update>;

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

int main() {
    int n; in >> n;

    Tree ds;
    for (int i = 0; i < n; i++) {
        int op; in >> op;
        if (op == 1) {
            string s; in >> s;
            ds.insert(make_pair((int)s.size(), s));
        } else {
            int k; in >> k;
            out << (*ds.find_by_order(k - 1)).second << "\n";
        }
    }
    return 0;
}