#include<iostream>
#Include<algorithm>
using namepsace std;
int i,j,n;
struct info
{ int p1,p2,p3,p4,p5,p6,g;
char nume[20],prenume[20];}
info v[100];
bool cmp ( info a , info b)
{ if(a.g>b.p)
return 1;
else
return 0;
}
int main()
{cin>>n;
for(i=1;i<=n;i++)
cin>>v[i].nume>>v[i].prenume>>v[i].p1>>v[i].p2>>v[i].p3>>v[i].p4>>v[i].p5>>v[i].p6>>v[i].g;
sort(v+1,v+1+n,cmp);
cout<<"premiul I"<<'\n';
i=1;
while(v[i]>g==v[1].g)
{cout<<v[i].nume<<" "<<v[i].prenume<<'\n';
i++;
}
cout<<"Premiul II"<<'\n';
j=i;
while(v[i]==v[j])
{cout<<v[i].nume<<" "<<v[i].prenume<<'\n';
i++;
}
cout<<"Premiul III"<<'\n';
j=i;
while(v[i]==v[j])
{cout<<v[i].nume<<" "<<v[i].prenume<<'\n';
i++;
}
return 0;
}
( Sper sa-ti fie de ajutor )
