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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

public class B implements Runnable {

    int[] f;

    private void solve() throws IOException {
        f = new int[13];
        f[1] = 31;
        f[2] = 28;
        f[3] = 31;
        f[4] = 30;
        f[5] = 31;
        f[6] = 30;
        f[7] = 31;
        f[8] = 31;
        f[9] = 30;
        f[10] = 31;
        f[11] = 30;
        f[12] = 31;

        String s = nextToken();

        HashMap<String, Integer> h = new HashMap<String, Integer>();

        for (int i = 0; i < s.length(); i++) {
            if (i + 10 > s.length()) break;
            String check = s.substring(i, i + 10);
            if (valid(check)) {
                if (h.containsKey(check)) {
                    h.put(check, h.get(check) + 1);
                } else {
                    h.put(check, 1);
                }
            }
        }

        String res = "";
        int max = 0;
        for (String k : h.keySet()) {
            int cnt = h.get(k);
            if (cnt > max) {
                max = cnt;
                res = k;
            }
        }
        int c = 0;
        for (String k : h.keySet()) {
            int cnt = h.get(k);
            if (cnt == max) {
                c++;
            }
        }
        if (c > 1) {
            throw new RuntimeException();
        }
        pl(res);
    }

    private boolean valid(String s) {
        String[] f = s.split("[-]");
        if (f.length != 3)
            return false;

        if (f[0].contains("-") || f[0].equals(""))
            return false;
        if (f[1].contains("-") || f[1].equals(""))
            return false;
        if (f[2].contains("-") || f[2].equals(""))
            return false;

        int days = Integer.parseInt(f[0]);
        if (days < 10) {
            if (f[0].length() < 2)
                return false;
        }
        int months = Integer.parseInt(f[1]);
        if (months < 10) {
            if (f[1].length() < 2)
                return false;
        }
        int years = Integer.parseInt(f[2]);
        if (years != 2013 && years != 2014 && years != 2015) {
            return false;
        }
        if (months > 12 || months == 0)
            return false;
        if (days > this.f[months] || days == 0)
            return false;
        return true;
    }

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

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;

    public void run() {
        try {
            reader = new BufferedReader(new BufferedReader(
                    new InputStreamReader(System.in)));
            writer = new PrintWriter(System.out);
            tokenizer = null;
            solve();
            reader.close();
            writer.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    BigInteger nextBigInteger() throws IOException {
        return new BigInteger(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    void p(Object... objects) {
        for (int i = 0; i < objects.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.flush();
            writer.print(objects[i]);
            writer.flush();
        }
    }

    void pl(Object... objects) {
        p(objects);
        writer.flush();
        writer.println();
        writer.flush();
    }

    int cc;

    void pf() {
        writer.printf("Case #%d: ", ++cc);
        writer.flush();
    }

}