#include <fstream>
#include <set>
#include <array>

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

oset<int>s;

int main() {
    ifstream fin("nums.in");
    ofstream fout("nums.out");
    int q;
    fin >> q;
    while (q--) {
        int t, k;
        fin >> t >> k;
        if (t == 0) {
            fout << *s.find_by_order(k - 1) << "\n";
        } else {
            s.insert(k);
        }
    }
    return 0;
}