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 Main {

    public static void print(Object x) {
        System.out.println(x + "");
    }
    public static ArrayList<String> readChars(String s) {
        ArrayList<String> out = new ArrayList<String>();
        for (int i = 0; i < s.length(); i++) {
            out.add(s.substring(i, i+1));
        }
        return out;
    }

    public static boolean isValid(String date) {
        ArrayList<String> s = readChars(date);
        for (int i : new int[] {2, 5}) {
            if (!s.get(i).equals("-")) return false;
        }
        for (int i : new int[] {0, 1, 3, 4, 6, 7, 8, 9}) {
            if (!"0123456789".contains(s.get(i))) return false;
        }
        int dd = Integer.parseInt(date.substring(0, 2));
        int mm = Integer.parseInt(date.substring(3, 5));
        int yyyy = Integer.parseInt(date.substring(6, 10));
        if (!(yyyy >= 2013 && yyyy <= 2015)) return false;
        if (!(mm >= 1 && mm <= 12)) return  false;
        int[] monthToDays = new int[] {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        if (!(dd >= 1 && dd <= monthToDays[mm])) return false;
        return true;
    }

    public static void solve(String prophecy) {
        Map<String, Integer> appearances = new HashMap<String, Integer>();
        for (int i = 0; i < prophecy.length() - 9; i++) {
            String date = prophecy.substring(i, i + 10);
            if (isValid(date)) {
                if (!appearances.containsKey(date)) {
                    appearances.put(date, 0);
                }
                appearances.put(date, appearances.get(date) + 1);
            }
        }

        String maxDate = "";
        int max = 0;
        for (Map.Entry<String, Integer> entry : appearances.entrySet()) {
            if (entry.getValue() > max) {
                max = entry.getValue();
                maxDate = entry.getKey();
            }
        }
        print(maxDate);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        solve(in.next());
    }
}
