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.*;
import java.util.regex.*;
import java.lang.Math.*;

public class Main {
    private Scanner sc = new Scanner(System.in);
    private static double EPS = 1e-9;
    private static final int INF = Integer.MAX_VALUE;

    public static void main(String[] args) {
        new Main().run();
    }

    private void run() {
        solve();
    }

    private int n;

    private void read() {
        n = sc.nextInt();
    }

    private void solve() {
        String line = sc.nextLine();
        parse(line);
    }
    private void parse(String line) {
        Map<String, Integer> map = new HashMap<String, Integer>();
        Matcher m = getMatcher(line);

        int max = 0;
        for (int start = 0; m.find(start); start = m.start() + 1) {
            String str = m.group();

            if (isValid(str)) {
                if (map.containsKey(str)) {
                    int count = map.get(str);
                    map.put(str, count + 1);
                    max = Math.max(max, count + 1);
                } else {
                    map.put(str, 1);
                    max = Math.max(max, 1);
                }
            }
        }

        for (String key : map.keySet()) {
            int count = map.get(key);
            if (count == max) {
                System.out.println(key);
                return;
            }
        }
    }

    private Matcher getMatcher(String line) {
        String regexp = "\\d\\d-\\d\\d-\\d\\d\\d\\d";
        Pattern p = Pattern.compile(regexp);
        Matcher m = p.matcher(line);
        return m;
    }
    private boolean isValid(String date) {
        String[] sp = date.split("-");
        int d = Integer.parseInt(sp[0]);
        int m = Integer.parseInt(sp[1]);
        int y = Integer.parseInt(sp[2]);
        return (isValid(d, m, y));
    }
    private boolean isValid(int d, int m, int y) {
        final int[] darray = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        if ((y < 2013) || (2015 < y)) return false;
        if ((m < 1) || (12 < m)) return false;
        if ((d < 1) || (darray[m - 1] < d)) return false;
        return true;
    }
}
