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.InputStream;
import java.io.InputStreamReader;
import java.text.SimpleDateFormat;
import java.util.Arrays;
import java.util.Date;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Round_158_B {

    static TreeMap<String, Integer> M = new TreeMap<String, Integer>();

    static class pair implements Comparable<pair> {

        String name;
        int count;

        public pair(String key, Integer value) {
            name = key;
            count = value;
        }

        @Override
        public int compareTo(pair o) {

            return new Integer(o.count).compareTo(count);
        }

    };

    public static void main(String[] args) {

        String Line;
        InputReader in = new InputReader(System.in);
        Line = in.next();
        gen(Line);
        String ans = "";
        pair[] all = new pair[M.size()];
        int i = 0;
        for (Entry<String, Integer> S : M.entrySet()) {
            all[i++] = new pair(S.getKey(), S.getValue());
        }
        Arrays.sort(all);
        i = 0;
        while (true) {
            ans = all[i++].name;
            if (valid(ans)) {
                System.out.println(ans);
                return;
            }
        }
    }

    private static boolean valid(String ans) {
        try {
            if (ans.charAt(2) != '-' || ans.charAt(5) != '-')
                return false;
            int day = Integer.parseInt(ans.substring(0, 2));
            int month = Integer.parseInt(ans.substring(3, 5));
            int year = Integer.parseInt(ans.substring(6, 10));
            if (year > 2015 || year < 2013)
                return false;
            if (day > 31 || day == 0)
                return false;
            if (month == 2 && day > 28)
                return false;
            if (day > 30) {
                if (month != 1 && month != 3 && month != 5 && month != 7
                        && month != 8 && month != 10 && month != 12)
                    return false;
            }

        } catch (Exception e) {

            return false;
        }

        return true;
    }

    private static void gen(String x) {
        int n = x.length();
        String S;
        for (int i = 0; i <= n - 10; i++) {
            S = x.substring(i, i + 10);
            Integer K = M.get(S.toString());
            if (K == null) {
                M.put(S, 1);
            } else
                M.put(S, K + 1);
        }
    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

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

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
                return 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());
        }
    }

}
