#include<bits/stdc++.h>
using namespace std;
struct fx{
	int bh;
	float cj;
}a[200];
int n,x,mn=INT_MAX,mx=INT_MIN,s;
bool cmp(fx b,fx c){
	return b.cj>c.cj;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].bh;
		s=0;
		mn=INT_MAX,mx=INT_MIN;
		for(int j=1;j<=5;j++){
			cin>>x;
			s=s+x;
			mn=min(mn,x);
			mx=max(mx,x);
		}
		a[i].cj=(s-mn-mx)*1.0/3;
		
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=3;i++){
		printf("%d %.3f\n",a[i].bh,a[i].cj);
	}
	

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	return 0;
}
/**************************************************************
	Problem: 1315
	User: zhuanghaoxiang
	Language: C++
	Result: Accepted
	Time:8 ms
	Memory:2080 kb
****************************************************************/