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.io.*;
import java.math.BigInteger;

public class Main {
    
    Map<Integer, Integer> mp = new HashMap<Integer, Integer>();
    int[] days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    void gao(char[] s, int base) {
        for (int i = 0; i < 10; ++i) {
            if (base + i >= s.length) return;
            if (i == 2 || i == 5) {
                if (s[i + base] != '-') return;
            } else if (s[i + base] == '-') return;
        }
        int d = (s[0 + base] - '0') * 10 + s[1 + base] - '0';
        int m = (s[3 + base] - '0') * 10 + s[4 + base] - '0';
        int y = (s[6 + base] - '0') * 1000 + (s[7 + base] - '0') * 100
            + (s[8 + base] - '0') * 10 + s[9 + base] - '0';
        if (y < 2013 || y > 2015) return;
        if (m < 1 || m > 12) return;
        if (d < 1 || d > days[m - 1]) return;
        int state = y * 10000 + m * 100 + d;
        Integer num = mp.get(state);
        if (num == null) num = 0;
        mp.put(state, num + 1);
    }
    
    void run(int nT) {
        char[] s = cin.next().toCharArray();
        for (int i = 0; i < s.length; ++i) {
            gao(s, i);
        }
        Integer state = null, num = null;
        for (Map.Entry<Integer, Integer> entry : mp.entrySet()) {
            Integer s1 = entry.getKey();
            Integer s2 = entry.getValue();
            //System.out.println(s1 + " " + s2);
            if (num == null || s2 > num) {
                state = s1;
                num = s2;
            }
        }
        int y = state / 10000; state %= 10000;
        int m = state / 100; state %= 100;
        int d = state;
        out.printf("%02d-%02d-%d\n", d, m, y);
    }

    public static void main(String[] argv) {
        Main solved = new Main();
        //solved.init();
        int T = 1;
        //T = solved.cin.nextInt();
        for (int nT = 1; nT <= T; ++nT) {
            solved.run(nT);
        }
        solved.out.close();
    }

    InputReader cin = new InputReader(System.in);
    PrintWriter out = new PrintWriter(System.out);
}

class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }
}