#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
#define pil pair<int,int>
#define p3 pair<int,pii>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
if(e==0) return 1;
int tmp=expo(b,e/2);
if(e%2) return mul(tmp,mul(tmp,b));
else return mul(tmp,tmp);
}
const int maxn=200005;
const int N=1e5;
bool comp(pair<int,pair<string,int>>x,pair<int,pair<string,int>>y){
if(x.fi!=y.fi) return x.fi>y.fi;
else x.se.fi<y.se.fi;
}
bool sam(string s,string t){
int x=min(s.length(),t.length());
repp(i,0,x-1){
if(s[i]!=t[i]) return s[i]<t[i];
}
return s.length()<t.length();
}
void solve(){
int n;cin>>n;
pair<int,pair<string,int>> a[n+2];
repp(i,1,n){
cin>>a[i].se.fi;a[i].se.se=i;
a[i].first=0;
repp(j,1,5){
int x;cin>>x;
a[i].fi+=x;
}
}
sort(a+1,a+n+1,comp);
vector<pii>ans(n+2);
// repp(i,1,n) cout<<a[i].fi<<" "<<a[i].se.fi<<" "<<a[i].se.se<<endl;
repp(i,1,n){
int l=1,r=i-1;
int an=i;
while(l<=r){
int mid=(l+r)/2;
if(a[mid].fi<a[i].first+500 || (a[mid].fi==a[i].fi+500 && sam(a[i].second.fi,a[mid].se.fi))){
an=mid;
r=mid-1;
} else l=mid+1;
}
ans[a[i].se.se].fi=an;
l=i+1,r=n;
an=i;
while(l<=r){
int mid=(l+r)/2;
if(a[mid].fi>a[i].first-500 || (a[mid].fi==a[i].fi-500 && sam(a[mid].second.fi,a[i].se.fi))){
an=mid;
l=mid+1;
} else r=mid-1;
}
ans[a[i].se.se].se=an;
}
repp(i,1,n) cout<<ans[i].fi<<" "<<ans[i].se<<endl;
}
signed main(){
liow;
int t=1;
// cin>>t;
while(t--){
solve();
}
}
