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.*;
public class B260_Ancient_Prophesy {
    public static void main (String[]args)throws Exception{
        BufferedReader read = new BufferedReader(new InputStreamReader (System.in));
        HashMap<String,Integer> map = new HashMap<String,Integer>();
        
        
            String[] days = new String [1500];
            String n = "";
            int l,c=0;
            for(int x=2013;x<=2015;x++){
                for(int m=1;m<=12;m++){
                    if(m > 9)
                        n = "-" + m + "-" + x;
                    else
                        n = "-0" + m + "-" + x;
                    switch(m){
                        case 1:case 3: case 5: case 7: case 8: case 10: case 12 :l=31;break;
                        case 2: l = 28;break;
                        default : l = 30;
                    }
                    for(int d=1;d<=l;d++)
                        if(d <= 9)
                            map.put("0" + d + n, 0);
                        else
                            map.put(d + n,0);
                    
                }
            }
        
        
        String in = read.readLine();
        String[] di = new String[100000];
        for(int i=0;i<=in.length()-10;i++)
            di[i] = in.substring(i,i+10);
        
        int max  = 0;
        String ans = "";
        for(int i=0;i<di.length;i++){
            if(map.get(di[i]) != null){
                map.put(di[i],map.get(di[i])+1);
                if(map.get(di[i]) > max){
                    max = map.get(di[i]);
                    ans = di[i];
                }
            }
        }
        
        System.out.println(ans); 
    }
}