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.Iterator;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String input = sc.nextLine();
        TreeMap<String, Integer> count = new TreeMap<String, Integer>();
        for (int i = 0; i < input.length()-9; i++) {
            String substr = input.substring(i, i+10);
            if(isValid(substr)){
                String key =(substr);
                if(count.containsKey(key)) count.put(key, count.get(key)+1);
                else count.put(key, 1);
            }
        }
        Set<String> keys = count.keySet();
        int max = -1;
        String out = "";
        for (Iterator i = keys.iterator(); i.hasNext();) {
            String key = (String) i.next();
            if(count.get(key)>max){
                max = count.get(key);
                out = key;
            }
        }
        System.out.print(out);
    }
    
    private static int key(String str){
        int day = Integer.parseInt(str.substring(0,2));
        int month = Integer.parseInt(str.substring(3,5));
        int year = Integer.parseInt(str.substring(6));
        return year*400+month*31*day;
    }
    
    private static String fromKey(int key){
        int year = key/400;
        int month = (key-year*400)%31;
        int day = (key-400*year-31*month)%31;
        return String.format("%2d-%2d-%4d", day, month, year);
    }
    
    private static Boolean isValid(String str) {
        try{
            if((str.charAt(2) != '-') || (str.charAt(5) != '-')){
                return false;
            }
            int day = Integer.parseInt(str.substring(0,2));
            int month = Integer.parseInt(str.substring(3,5));
            int year = Integer.parseInt(str.substring(6));
            
            if((year < 2013) || (year > 2015)) return false;
            if((month<1) || (month>12)) return false;
            if((day<1) || ((month < 8)&&(month%2==1)&&(day>31)) || ((month < 8)&&(month%2==0)&&(day>30))
                     || ((month >= 8)&&(month%2==0)&&(day>31)) || ((month >= 8)&&(month%2==1)&&(day>30))) return false;
            if((month==2)&&(day>28)) return false;
            
            return true;
        }catch (Exception e) {
            return false;
        }
    }
}
