// Sensei knows what he's doing!
#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;

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

tree<pair<int, string>, null_type, less<pair<int, string>>, rb_tree_tag, tree_order_statistics_node_update> mytree;

int main(void) {
    string num;
    int n, k, op;

    fi >> n;
    while (n--) {
        fi >> op;
        switch (op) {
        case 0: {
            fi >> k, --k;
            fo << mytree.find_by_order(k)->second << '\n';
            break; }
        case 1: {
            fi >> num;
            mytree.insert({num.size(), num});
            break; } } }


    return 0; }