A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-".

We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format "dd-mm-yyyy". We'll say that the number of the date's occurrences is the number of such substrings in the Prophesy. For example, the Prophesy "0012-10-2012-10-2012" mentions date 12-10-2012 twice (first time as "0012-10-2012-10-2012", second time as "0012-10-2012-10-2012").

The date of the Apocalypse is such correct date that the number of times it is mentioned in the Prophesy is strictly larger than that of any other correct date.

A date is correct if the year lies in the range from 2013 to 2015, the month is from 1 to 12, and the number of the day is strictly more than a zero and doesn't exceed the number of days in the current month. Note that a date is written in the format "dd-mm-yyyy", that means that leading zeroes may be added to the numbers of the months or days if needed. In other words, date "1-1-2013" isn't recorded in the format "dd-mm-yyyy", and date "01-01-2013" is recorded in it.

Notice, that any year between 2013 and 2015 is not a leap year.

Input

The first line contains the Prophesy: a non-empty string that only consists of digits and characters "-". The length of the Prophesy doesn't exceed 105 characters.

Output

In a single line print the date of the Apocalypse. It is guaranteed that such date exists and is unique.

Examples

Input

777-444---21-12-2013-12-2013-12-2013---444-777


Output

13-12-2013
import java.io.*;
import java.util.*;
import java.lang.Math.*;
public class cf158B
{
     public static void main(String args[])throws Exception
     {
         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         String s=br.readLine();
         
         int rec[][][]=new int[3][13][32];
         
         int final_date[]=new int[3];
         
         int day[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
         
         String possible[]=s.split("-");
         int i,j,k,l;
         l=possible.length;
         
         /*for(i=0;i<l;i++)
         System.out.print(possible[i]+" ,");
         System.out.println();*/
         
         int d,m,y;
         
         for(i=0;i<l-2;i++)
         {
             if(possible[i].length()>=2 && possible[i+1].length()==2 && possible[i+2].length()>=4)
             {
                 d=Integer.parseInt(possible[i].substring(possible[i].length()-2));
                 m=Integer.parseInt(possible[i+1]);
                 y=Integer.parseInt(possible[i+2].substring(0,4));
                 
                 if(y>=2013 && y<=2015 && m>=1 && m<=12)
                 {
                     if(day[m]>=d && d>0)
                     {
                         rec[y-2013][m][d]++;
                        }
                    }
                }
            }
         int max=0;
         
         for(i=0;i<3;i++)
         {
             for(j=0;j<13;j++)
             {
                 for(k=0;k<32;k++)
                 {
                     if(max<rec[i][j][k])
                     {
                         max=rec[i][j][k];
                         final_date[0]=k;
                         final_date[1]=j;
                         final_date[2]=i+2013;
                        }
                    }
                }
            }
            
         print_date(final_date);
     }
     
     public static void print_date(int a[])throws Exception
     {
         PrintWriter pw=new PrintWriter(System.out);
         
         if((a[0]+"").length()<2)
         pw.print("0");
         
         pw.print(a[0]+"-");
         
         if((a[1]+"").length()<2)
         pw.print("0");
         
         pw.print(a[1]+"-"+a[2]);
         pw.flush();
     }
}
