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.util.*;
import java.math.*;
import java.io.*;

public class Main
    {
    public static void main(String args[]) throws IOException
        {
        BufferedReader c=new BufferedReader(new InputStreamReader(System.in));
        String S=c.readLine();
        HashMap<String, Integer> M=new HashMap<String, Integer>();
        int Days[]=new int[]{31,28,31,30,31,30,31,31,30,31,30,31};
        for(int i=0;i<=S.length()-10;i++)
            {
            String now=S.substring(i,i+10);
            //System.out.println(now);
            String parts[]=now.split("-");
            //System.out.println(Arrays.toString(parts));
            if(parts.length==3&&parts[0].length()==2&&parts[1].length()==2&&parts[2].length()==4)
                {
                //System.out.println(Arrays.toString(parts));
                int year=Integer.parseInt(parts[2]);
                if(year<2013||year>2015)
                    continue;
                int month=Integer.parseInt(parts[1]);
                if(month<=0||month>12)
                    continue;
                int day=Integer.parseInt(parts[0]);
                if(day<1||day>Days[month-1])
                    continue;
                if(M.containsKey(now))
                    M.put(now,M.get(now)+1);
                else
                    M.put(now,1);
                }
            }
        String maxDate="";
        int maxOcc=0;
        for(String k:M.keySet())
            {
            if(M.get(k)>maxOcc)
                {
                maxOcc=M.get(k);
                maxDate=k;
                }
            }
        System.out.println(maxDate);
        }
    }

//must declare new classes here