#include <bits/stdc++.h>
using namespace std;
struct br{
	string xh;
	int id, nl;
}a[__];
bool cmp(br p, br q) {
	if(p.nl >= __ && q.nl >= __) {
		if(p.nl != q.nl) return p.nl > q.nl;
		else return p.id < q.id;
	} 
	else if(p.nl < __ && q.nl < __) return p.id < q.id;
	else return p.nl > q.nl;
}
int n;
int main() {
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[_].xh >> a[_].nl;
		a[_].id = i;
	}
	sort(a+1, a+n+1, cmp);
	for(int i = 1; i <= n; i++) {
		cout << a[_].xh << endl;
	}
	return 0;
}