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.*;

public class AncientProphesy {

    public static void main(String... args) {

        Scanner sc = new Scanner(System.in);
        
        StringBuffer sb = new StringBuffer(sc.nextLine());
        HashMap<String, Integer> hm = new HashMap<String, Integer>();
        
        int[] days = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        
        for (int i=0; i<sb.length()-9; i++)
        {
            int d = parseInt(sb.substring(i,   i+2));
            int m = parseInt(sb.substring(i+3, i+5));
            int y = parseInt(sb.substring(i+6, i+10));
            
            if (sb.charAt(i+2)=='-' && sb.charAt(i+5)=='-' && isMonth(m) && isYear(y) && d>=1 && d<=days[m])
            {
                String dt = addZero(d)+"-"+addZero(m)+"-"+y;
                if (hm.containsKey(dt))
                    hm.put(dt, hm.get(dt)+1);
                else 
                    hm.put(dt, 1);
            }
        }

        String date = "";
        int max = 0;
        for (Map.Entry<String, Integer> e : hm.entrySet()) {
            if (max<e.getValue()) {
                max  = e.getValue();
                date = e.getKey();
            }
        }
        System.out.println(date);
    }
    
    static String addZero(int i) {
        return i>9 ? String.valueOf(i) : "0"+i;
    }
    
    static int parseInt(String s) {
        int i=0;
        try {
            i = Integer.parseInt(s);
        } catch (Exception e) {}
        return i;
    }
    
    static boolean isMonth(int m) {
        return m>=1 && m<=12;
    }
    
    static boolean isYear(int y) {
        return y>=2013 && y<=2015;
    }
    
}