//COCI 2021-22 ROUND 6 PROBLEM 1
#include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define vn vector <ll>
using namespace std;
#define pii pair <ll,string>
#define pb push_back
#define srt(vp) sort(vp.begin(), vp.end())
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vector<pii> beekeepers(n);
for (int i = 0; i < n; i++) {
string s;
ll sum = 0;
cin >> s;
for (int j = 0; j < 5; j++) {
ll score;
cin >> score;
sum += score;
}
beekeepers[i] = {sum, s};
}
for (int i = 0; i < n; i++) {
ll max_possible = beekeepers[i].first + 500;
ll min_possible = beekeepers[i].first;
int best_pos = 1, worst_pos = n;
for (int j = 0; j < n; j++) {
if (i != j) {
if (beekeepers[j].first + 500 < max_possible ||
(beekeepers[j].first + 500 == max_possible && beekeepers[j].second > beekeepers[i].second)) {
best_pos++;
}
if (beekeepers[j].first > min_possible ||
(beekeepers[j].first == min_possible && beekeepers[j].second < beekeepers[i].second)) {
worst_pos--;
}
}
}
cout << best_pos << " " << worst_pos << endl;
}
}
