#include<iostream>
#include<algorithm>
using namespace std;
struct dangan{
    string name;
    double ch,math,total;
    int id;
};
bool cmp(dangan x,dangan y){
    return x.total>y.total;
}
int main(){
    int n;
    cin>>n;
        dangan a[105];
        for(int i=1;i<=n;i++){
        cin>>a[i].name>>a[i].ch>>a[i].math;
        a[i].total=a[i].ch+a[i].math;
    }
    sort(a+1,a+n+1,cmp);
    a[1].id=1;
    for(int i=2;i<=n;i++){
        if(a[i].total==a[i-1].total){
            a[i].id=a[i-1].id;
        }else{
            a[i].id=i;
        }
    }
        for(int i=1;i<=n;i++){
            cout<<a[i].name<<" "<<a[i].ch<<" "<<a[i].math<<" "<<a[i].total<<" "<<a[i].id<<endl;
        }
    return 0;
}