#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 r("nums.in");
ofstream w("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;
    r >> n;
    while (n--)
    {
        r >> op;
        if(op==0)
        {
            r >> k, --k;
            w << mytree.find_by_order(k)->second << '\n';
            break;
        }
        else
        {
            r >> num;
            mytree.insert({num.size(), num});
            break;
        }
    }
    return 0;
}