#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(v)                                                                 \
    cerr << "Line(" << __LINE__ << ") -> " << #v << " = " ; 
#define dbx(x) debug(x); cerr << x << "\n";
#define dbg(x) debug(x); cerr << "{ "; for(auto &e : x) cerr << e << ", "; cerr << "} \n";

// Code
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e6+10, MOD = (ll)1e9+7, OO = (ll)1e17+10;

void solve(){

    o_set<int>se;
    se.insert(1);
    se.insert(2);
    cout << *se.find_by_order(0) << endl; ///k th element
    cout << se.order_of_key(2) << endl; ///number of elements less than k

}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll tc = 1; // cin >> tc;
    for(int t = 1 ; t <= tc ; t ++){
        solve();
    }

    return 0;
}

/*

*/