// Problem: P1093 [NOIP2007 普及组] 奖学金
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1093
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// User: Pannnn

#include <bits/stdc++.h>

using namespace std; 

struct Stu {
    int chinese;
    int math;
    int english;
    int id;
    int total;
    Stu() { }
    
    Stu(int chinese, int math, int english, int id) {
        this->chinese = chinese;
        this->math = math;
        this->english = english;
        this->id = id;
        this->total = chinese + math + english;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    vector<Stu> info(n);
    int cs, ms, es;
    for (int i = 0; i < n; ++i) {
        cin >> cs >> ms >> es;
        info[i] = Stu(cs, ms, es, i + 1);
    }
    
    sort(info.begin(), info.end(), [](const Stu &s1, const Stu &s2) -> bool {
        if (s1.total != s2.total) {
            return s1.total > s2.total;
        } else if (s1.chinese != s2.chinese) {
            return s1.chinese > s2.chinese;
        } else {
            return s1.id < s2.id;
        }
    });
    
    for (int i = 0; i < 5; ++i) {
        cout << info[i].id << " " << info[i].total << endl;;
    }
    return 0;
}