#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
template <class K> using mset = __gnu_pbds::tree<K, __gnu_pbds::null_type, less_equal<K>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
mset<int> ms; //multiset
int main() {
	ms.insert(-1);
	ms.insert(1);
	ms.insert(1);
	ms.insert(3);
	ms.insert(3);
	ms.insert(5);
	ms.insert(5);
	//ms.order_of_key(x) = # of values < x
	cout << ms.order_of_key(1) << endl; //# values < 1
	cout << ms.order_of_key(3) << endl; //# values < 3
	cout << ms.order_of_key(5) << endl; //# values < 5
	cout << ms.order_of_key(6) << endl; //# values < 6
	return 0;
}