/**

 * Copyright(c)

 * All rights reserved.

 * Author : YCute

 * Date : 2019-11-19-20.13.37

 * Description : 结构体排序

 */

 #include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 struct bir{

     char name[];

     int year;

     int month;

     int day;

 };

 int cmp(struct bir a,struct bir b){

     if(a.year<b.year) return ;

     else if(a.year==b.year){

         if(a.month<b.month) return ;

         else if(a.month==b.month){

             if(a.day<b.day) return ;

             else return ;

         }else return ;

     }else{

         return ;

     }

 }

 int main(){

     int n;

     struct bir b[];

     scanf("%d",&n);

     getchar();

     for(int i=;i<n;i++){

         scanf("%s %4d/%2d/%2d",b[i].name,&b[i].year,&b[i].month,&b[i].day);

     }

     sort(b,b+n,cmp);

     int i=;

     while(){

         if(b[i].year<){

                 i++;

                 continue;

         }

         else if(b[i].year==){

             if(b[i].month<){

                     i++;

                     continue;

             }

             else if(b[i].month==){

                 if(b[i].day<){

                         i++;

                         continue;

                 }

                 else break;

             }else{

                 break;

             }

         }else{

             break;

         }

     }

     int j=n-;

     while(j){

         if(b[j].year>){

                 j--;

                 continue;

         }

         else if(b[j].year==){

             if(b[j].month>){

                 j--;

                 continue;

             }else if(b[j].month==){

                 if(b[j].day>){

                     j--;

                     continue;

                 }

                 else break;

             }else break;

         }else {

             break;

         }

     }

     printf("%d %s %s",j-i+,b[i].name,b[j].name);

     return ;

 }