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

public class Main {

    static BufferedReader br;
    static PrintWriter out;
    static StringTokenizer st;
    
    static void solve() throws Exception {
        String s = next();
        Hashtable<String, Integer> ht = new Hashtable<String, Integer>(100000);
        int k = "13-12-2013".length();
        int max = Integer.MIN_VALUE;    
        String maxStr = "";
        for(int i = 0; i + k <= s.length(); i++){
            String sub = s.substring(i, i + k);
            if(check(sub)){
                if(ht.containsKey(sub)){
                    int cnt = ht.get(sub);
                    ht.remove(sub);
                    ht.put(sub, cnt + 1);
                }else{
                    ht.put(sub, 1);
                }
                int local = ht.get(sub);
                if(local > max){
                    max = local;
                    maxStr = sub;
                }
            }
        }
        out.println(maxStr);
    }

    static int[] dayInMonth = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30 ,31, 30, 31};
    
    private static boolean check(String sub) {
        String[] s = sub.split("-");
        if(s.length != 3){
            return false;
        }
        if(s[0].length() != 2 || s[1].length() != 2 || s[2].length() != 4){
            return false;
        }
        int day = Integer.parseInt(s[0]);
        int month = Integer.parseInt(s[1]);
        int year = Integer.parseInt(s[2]);
        if(!(year >= 2013 && year <= 2015)){
            return false;
        }
        if(!(month >= 1 && month <= 12)){
            return false;
        }
        if(!(day >= 1 && day <= dayInMonth[month - 1])){
            return false;
        }
        return true;
    }

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

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

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

    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return null;
            }
            st = new StringTokenizer(line);
        }
        return st.nextToken();
    }

    public static void main(String[] args) {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(new PrintStream(System.out));
            solve();
            out.close();
            br.close();
        } catch (Throwable t) {
            t.printStackTrace();
        }
    }

}
