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.*;

public class judge {

    FastScanner in;
    PrintWriter out;
    
    public boolean ifmonth(int num1, int num2, int num3){
        if (num3 < 2013 || num3 > 2015 || num2 == 0 || num2 > 12 || num1 == 0)
            return false;
        if ((num2 == 1 || num2 == 3 || num2== 5 || num2 == 7 || num2 == 8 || num2 == 10 || num2 == 12) && num1 > 31)
            return false;
        if (num2 == 2 && num1 > 28)
            return false;
        if ((num2 == 4 || num2 == 6 || num2 == 9 || num2 == 11) && num1 > 30)
            return false;
        return true;
    }

    public void solve() throws IOException {
        Scanner read = new Scanner(System.in);
        String ss = read.nextLine();
        char[] s = ss.toCharArray();
        int n = ss.length();
        ArrayList<String> ans = new ArrayList<String>();
        ArrayList<Integer> num = new ArrayList<Integer>();
        for(int i = 0; i < n - 9; i++){
            String tmp = "";
            if (s[i + 2] == '-' && s[i + 5] == '-'){
                boolean bl = true;
                for(int j = 0; j < 10 && bl; j++)
                    if ((s[i + j] < '0' || s[j + i] > '9') && j != 2 && j != 5)
                        bl = false;
                if (bl){
                    int num1 = (int)(s[i] - '0') * 10 + (int)(s[i + 1] - '0');
                    int num2 = (int)(s[i + 3] - '0') * 10 + (int)(s[i + 4] - '0');
                    int num3 = (int)(s[i + 6] - '0') * 1000 + (int)(s[i + 7] - '0') * 100 + (int)(s[i + 8] - '0') * 10 + (int)(s[i + 9] - '0');
                    if (ifmonth(num1, num2, num3)){
                        for(int j = 0; j < 10; j++)
                            tmp += Character.toString(s[i + j]);
                        if (ans.contains(tmp))
                            num.set(ans.indexOf(tmp), num.get(ans.indexOf(tmp)) + 1);
                        else{
                            ans.add(tmp);
                            num.add(1);
                        }
                    }
                }
            }
        }
        String res = ans.get(0);
        int max = num.get(0);
        for(int i = 0; i < ans.size(); i++)
            if (max < num.get(i)){
                max = num.get(i);
                res = ans.get(i);
            }
        System.out.print(res);
    }

    public void run() {
        try {
            in = new FastScanner(new File("absmarkchain.in"));
            out = new PrintWriter(new File("absmarkchain.out"));

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {

        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

        double nextDouble() {
            return Double.parseDouble(next());
        }
    }

    public static void main(String[] arg) {
        new judge().run();
    }
}