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.*;
import java.math.BigInteger;
import java.util.*;
import java.util.logging.Level;
import java.util.logging.Logger;

public class Main {

    private void run() {
            
            try {
               String input = in.readLine();
               s = input.toCharArray();
            } catch (IOException ex) {
                throw new RuntimeException("input");
            }
            int l = -1;
            for (int r = 1; r < s.length; r++) {
                if (s[r] == '-') {
                    if (r - l == 3 && l >= 2 && r + 4 < s.length) {
                        check(l - 2, r + 4);
                    }
                    l = r;
                }
            }
            Iterator it = map.entrySet().iterator();
            String ans = "$";
            int max = 0;
            while (it.hasNext()) {
                Map.Entry pairs = (Map.Entry)it.next();
                Integer val = (Integer) pairs.getValue();
                if (val > max) {
                    max = val;
                    ans = (String) pairs.getKey();
                }
            }
            out.println(ans);
            
            out.close();
    }

    public static void main(String[] args) {
        new Main().run();
    }
        char s[];
        Map<String, Integer> map = new HashMap<String, Integer>();
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    private void check(int l, int r) {
//        System.out.println(l + " " + r);
        int d = 0, m = 0, y = 0;
        String x = "";
        for (int j = l; j <= r; j++) {
            x += s[j];
            if (j != l + 2 && j != r - 4) {
                if (s[j] < '0' || s[j] > '9') return;
                if (j < l + 2) {
                    d = d * 10 + s[j] - '0';
                } else if (j < r - 4) {
                    m = m * 10 + s[j] - '0';
                } else
                    y = y * 10 + s[j] - '0';
            }
        }
//        System.out.println(d + " " + m + " " + y);
        if (m < 1 || m > 12) return;
        if (y < 2013 || y > 2015) return;
        if (d < 1 || d > days[m - 1]) return;
        Integer v = map.get(x);
        Integer nv = 1;
        if (v != null) 
            nv = v + 1;
        map.put(x, nv);
    }
    int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
}
