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

public class AncientProphecySolver {

    private String s;

    public static void main(String[] args) {
        AncientProphecySolver solver = new AncientProphecySolver();

        solver.readData();
        String result = solver.solve();

        System.out.println(String.format("%s", result));
    }

    private String solve() {
        Map<String, Integer> map = new HashMap<String, Integer>();
        int max = -1;
        String result = "";

        for (int i = 0; i <= s.length() - 10; i++) {
            String date = s.substring(i, i + 10);

            if (!isCorrect(date)) {
                continue;
            }

            int count;
            if (!map.containsKey(date)) {
                map.put(date, 1);
                count = 1;
            } else {
                map.put(date, map.get(date) + 1);
                count = map.get(date);
            }

            if (count > max) {
                max = count;
                result = date;
            }
        }

        return result;
    }

    private boolean isCorrect(String date) {
        String[] parts = date.split("-");

        if (parts.length != 3) {
            return false;
        }
        if (parts[0].length() != 2 || parts[1].length() != 2 || parts[2].length() != 4) {
            return false;
        }

        int year = Integer.valueOf(parts[2]);
        int month = Integer.valueOf(parts[1]);
        int day = Integer.valueOf(parts[0]);

        if (year < 2013 || year > 2015) {
            return false;
        }
        if (month <= 0 || month > 12) {
            return false;
        }
        if (day <= 0) {
            return false;
        }

        if (month == 2 && day > 28) {
            return false;
        }
        if (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12) {
            return day <= 31;
        } else {
            return day <= 30;
        }
    }

    private void readData() {
        Scanner scanner = new Scanner(System.in);

        s = scanner.next();
    }
}