#include<bits/stdc++.h> using namespace std; struct node { int id; int fs; }; node a[302]; bool cmp(node x,node y) { return x.fs >y.fs; } int main(){ int n,b[302],c[302],d[302]; cin>>n; for(int i=1;i<=n;i++){ cin>>b[i]>>c[i]>>d[i]; a[i].id=i; a[i].fs=b[i]+c[i]+d[i]; } sort(a+1,a+1+n,cmp); for(int i=1;i<=5;i++){ cout<<a[i].id <<' '<<a[i].fs<<endl; } return 0; }