#include <bits/stdc++.h>
using namespace std;
bool comp (pair <string, int> &a, pair <string, int> &b) {
return a.second == b.second ? a.first < b.first : a.second > b.second;
}
int main () {
int n;
cin >> n;
vector <pair <string, int>> pp;
for (int i = 0; i < n; i++) {
string t; cin >> t; int x = 0; for (int j = 0; j < 5; j++) {
int u; cin >> u; x += u;
}
pp.push_back({t, x});
}
for (int i = 0; i < n; i++) {
auto d = pp;
d[i].second += 500;
sort(d.begin(), d.end(), comp);
for (int j = 0; j < n; j++) {
if (d[j].first == pp[i].first) {
cout << j + 1 << " ";
}
}
d = pp;
d[i].second -= 500;
sort(d.begin(), d.end(), comp);
for (int j = 0; j < n; j++) {
if (d[j].first == pp[i].first) {
cout << j + 1 << '\n';
}
}
}
}
