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.IOException;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Matcher;
import java.util.regex.Pattern;



public class Main {

    /**
     * @param args
     * @throws IOException 
     */
    //static <T> List<T> nCopies(int n, T o) 
    static Scanner cin = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        
        Pattern pattern = Pattern.compile("(0[1-9]|[1-3]\\d)-(0[1-9]|1[0-2])-201[3-5]");
        Matcher matcher = pattern.matcher(cin.next());
        
        //while(matcher.find()) System.out.println(matcher.group());
        HashMap<String, Integer> cnt = new HashMap<String, Integer> ();
        
        
        if(matcher.find()) {
            if(check(matcher.group(1), matcher.group(2))) {
                String key = matcher.group();
                if(cnt.containsKey(key)) cnt.put(key, cnt.get(key) + 1);
                else cnt.put(key, 1);
            }
        }
        
        while(matcher.find(matcher.start() + 1)) {
            if(check(matcher.group(1), matcher.group(2))){
                String key = matcher.group();
                if(cnt.containsKey(key)) cnt.put(key, cnt.get(key) + 1);
                else cnt.put(key, 1);
            }
        }
        Map.Entry<String, Integer> ans = null;
        
        Set<Map.Entry<String, Integer>> set = cnt.entrySet();
        for(Iterator<Entry<String, Integer>> it = set.iterator();it.hasNext();) {
            Map.Entry<String, Integer> entry = it.next();
            if(ans == null || entry.getValue() > ans.getValue()) {
                ans = entry;
            }
        }
        System.out.println(ans.getKey());
    }//0012-10-2012-10-2012

    static boolean check(String _day, String _month) {

        int day = Integer.valueOf(_day);
        int month = Integer.valueOf(_month);
        //System.out.println(day + " " + month);
        int[] days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        if(days[month - 1] < day) return false;
        
        return true;
    }

}