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.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class AncientProphesy {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        String line = in.next();
        Pattern pattern = Pattern.compile("(\\d){2}-(\\d){2}-(\\d){4}");
        Matcher matcher = pattern.matcher(line);

        Map<String, Integer> dates = new HashMap<String, Integer>();

        int offset = 0, max = 0;
        String result = "";

        int[] datear = new int[] {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

        while (matcher.find(offset)) {
            String date = matcher.group();
            offset = matcher.start() + 8;

            String[] split = date.split("-");
            int dd = Integer.parseInt(split[0]);
            int mm = Integer.parseInt(split[1]);
            int yy = Integer.parseInt(split[2]);

            if (!(mm >= 1 && mm <= 12 && (yy >= 2013 && yy <= 2015) && dd >= 1 && dd <= datear[mm-1])) continue;

            if (!dates.containsKey(date)) dates.put(date, 0);
            dates.put(date, dates.get(date) + 1);

            if (max < dates.get(date)) {
                max = dates.get(date);
                result = date;
            }
        }
        out.println(result);
        out.close();
    }
}
