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.Scanner;
import java.util.StringTokenizer;

public class C {

    public static void main(String[] args) {
        int len[] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

        Scanner myScanner = new Scanner(System.in);
        String input = myScanner.next().replaceAll("--", "[*]")
                .replaceAll("[-]", " ");
        StringTokenizer tok = new StringTokenizer(input);

        String all[] = new String[tok.countTokens()];
        for (int i = 0; i < all.length; i++)
            all[i] = tok.nextToken();

        int dates[] = new int[31 * 12 * 2015];
        int max = -1, md = 0, mm = 0, my = 0;

        for (int i = 0; i < all.length - 2; i++) {
            try {
                if (all[i + 1].length() > 2 || all[i + 2].length() < 4)
                    continue;

                int n1 = all[i].length(), n2 = all[i + 1].length();

                int days[] = new int[2], months[] = new int[2];

                if (n1 >= 2)
                    days[1] = new Integer(all[i].substring(n1 - 2));
                else
                    days[0] = new Integer(all[i].substring(n1 - 1));

                if (n2 == 2)
                    months[1] = new Integer(all[i + 1].substring(n2 - 2));
                else
                    months[0] = new Integer(all[i + 1].substring(n2 - 1));

                int year = new Integer(all[i + 2].substring(0, 4));

                for (int j = 0; j < months.length; j++) {
                    for (int j2 = 0; j2 < days.length; j2++) {
                        int day = days[j2];
                        int mon = months[j];
                        if (day >= 1 && mon >= 1 && mon <= 12 && year >= 2013
                                && year <= 2015 && day <= len[mon]) {
                            int ii;
                            dates[(ii = day * mon * year)]++;
                            if (dates[ii] > max) {
                                max = dates[ii];
                                md = day;
                                mm = mon;
                                my = year;
                            }
                        }

                    }
                }
            } catch (Exception e) {
                continue;
            }
        }

        String sd = md + "";
        String sm = mm + "";

        if (sd.length() == 1)
            sd = '0' + sd;
        if (sm.length() == 1)
            sm = '0' + sm;

        System.out.println(sd + "-" + sm + "-" + my);
    }
}
