#include<bits/stdc++.h>
using namespace std;
struct abc{
	int bh;
	double fs;
}a[101];
int n,cj;
bool cmp(abc x,abc y){
	return x.fs>y.fs;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].bh;
		int temp=0,imin=1000000000,imax=0;
		for(int j=1;j<=5;j++){
			cin>>cj;
			temp=temp+cj; 
			imin=min(imin,cj);
			imax=max(imax,cj);
		}
		a[i].fs=(temp-imax-imin)*1.0/3;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=3;i++){
		printf("%d %.3lf\n",a[i].bh,a[i].fs);
	}

	return 0;
}

/**************************************************************
	Problem: 1315
	User: hulaoshi
	Language: C++
	Result: Accepted
	Time:7 ms
	Memory:2080 kb
****************************************************************/