#include <bits/stdc++.h> using namespace std; int n; struct node{ int zx; int ch; int ma; int en; int all; }a[100005]; bool cmp(node x, node y){ if(x.all != y.all){ return x.all > y.all; }else if(x.ch+x.ma+x.en == y.ch+y.ma+y.en){ if(x.ch != y.ch){ return x.ch > y.ch; }else if(x.ch == y.ch){ if(x.zx > y.zx){ return x.zx > y.zx; } } } } int main() { cin >> n; for(int i = 1;i <= n;i++){ a[i].zx = i; cin >> a[i].ch >> a[i].ma >> a[i].en; a[i].all = a[i].ch + a[i].ma + a[i].en; } sort(a+1, a+n+1, cmp); for(int i = 1;i <= 5;i++){ cout << a[i].zx << " " << a[i].all << endl; } return 0; }