#include <bits/stdc++.h>

using namespace std;

const int N = 1e2+5;

string input() {
    char t;
    string ans = "";
    t = getchar();
    while (t == ' ' || t == '\n')
        t = getchar();
    while (t != EOF && t != ' ' && t != '\n') {
        ans += t;
        t = getchar();
    }
    return ans;
}

void prints(string iut) {
    long long n = iut.size();
    for (int i = 0; i <= n; i++)
        putchar(iut[i]);
}

struct node {
	string n;
	int d;
} a[N];

bool cmp(node a, node b) {
	return a.d < b.d;
}
int main() {
	int m, a, b, c;
	scanf("%d", &m);
	for (int i = 1; i <= m; i++) {
		a[i].n = input();
		scanf("%d %d %d", &a, &b, &c);
		a[i].d = ((a * 1e2 + b) * 1e2 + c) * 1e3 + 100 - i;
	}
	sort(a + 1, a + m + 1, cmp);
	for (int i = 1; i <= 3; i++)
		prints(a[i].n);
	return 0;
}