#include<cstdio>#include<algorithm>#include<stdlib.h>struct pNode{	char id[20];	int hh;	int mm;	int ss;}temp,ans1,ans2;//ans1為簽到最早的，ans2為簽離最遲的bool great(pNode node1,pNode node2){	if(node1.hh!=node2.hh) return node1.hh>node2.hh;	else if(node1.mm!=node2.mm) return node1.mm>node2.mm;	else return node1.ss>node2.ss;}int main(){	int n;	scanf("%d",&n);	ans1.hh=24;ans1.mm=60;ans1.ss=60;	ans2.hh=0;ans2.mm=0;ans2.ss=0;	for(int i=0;i<n;i++)	{		scanf("%s %d:%d:%d",&temp.id,&temp.hh,&temp.mm,&temp.ss);		if(great(temp,ans1)==false) ans1=temp;		scanf(" %d:%d:%d",&temp.hh,&temp.mm,&temp.ss);		if(great(temp,ans2)==true) ans2=temp;	}	PRintf("%s %s",ans1.id,ans2.id);	system("pause");	return 0;}