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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Hashtable;
import java.util.StringTokenizer;

public class Round158_B {

    char[] tmp;
    // Jan 31
    // Feb 28 (29 in leap)
    // Mar 31
    // April 30
    // May 31
    // Jun 30
    // July 31
    // Aug 31
    // Sep 30
    // Oct 31
    // Nov 30
    // Dec 31
    int mon[] = new int[] { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

    public boolean check() {
        // dd-mm-yyyy
        if (tmp[2] != '-' || tmp[5] != '-')
            return false;
        for (int i = 0; i < 10; i++) {
            if (i != 2 && i != 5) {
                if (!(tmp[i] >= '0' && tmp[i] <= '9'))
                    return false;
            }
        }
        int day = (tmp[0] - '0') * 10 + (tmp[1] - '0');
        int month = (tmp[3] - '0') * 10 + (tmp[4] - '0');
        int year = (tmp[6] - '0') * 1000 + (tmp[7] - '0') * 100
                + (tmp[8] - '0') * 10 + (tmp[9] - '0');
        if (year < 2013 || year > 2015)
            return false;
        if (month < 1 || month > 12)
            return false;
        if (day > 0 && day <= mon[month - 1])
            return true;
        return false;
    }

    public void solve() throws Exception {

        InputReader in = new InputReader();
        char[] a = in.next().toCharArray();
        int N = a.length;
        tmp = new char[10];
        String[] answer = new String[N];
        int next = 0;
        Hashtable<String, Integer> hash = new Hashtable<String, Integer>();

        for (int i = 0; i < N - 10 + 1; i++) {
            for (int j = 0; j < 10; j++) {
                tmp[j] = a[i + j];
            }
            if (check()) {
                StringBuffer s = new StringBuffer("");
                for (int k = 0; k < 10; k++)
                    s.append(tmp[k]);
                Integer x = hash.get(s.toString());
                if (x != null) {
                    hash.put(s.toString(), x + 1);
                } else {
                    hash.put(s.toString(), 1);
                    answer[next++] = s.toString();
                }
            }
        }
        int max = 0;
        String ans = "";
        for (int i = 0; i < next; i++) {
            int x = hash.get(answer[i]);
            if (x > max) {
                max = x;
                ans = answer[i];
            }
        }
        System.out.println(ans);

    }
    

    public static void main(String[] args) throws Exception {
        new Round158_B().solve();

    }

    static class InputReader {
        BufferedReader in;
        StringTokenizer st;

        public InputReader() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
            st = new StringTokenizer(in.readLine());

        }

        public String next() throws IOException {

            while (!st.hasMoreElements())
                st = new StringTokenizer(in.readLine());
            return st.nextToken();
        }

        public int nextInt() throws NumberFormatException, IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws NumberFormatException, IOException {
            return Long.parseLong(next());
        }
    }

}
