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 {
    public static int[] prefix_function(String s) {
        int n = s.length();
        int[] pi = new int[n];
        for (int i = 1; i < n; ++i) {
            int j = pi[i - 1];
            while (j > 0 && s.charAt(i) != s.charAt(j))
                j = pi[j - 1];
            if (s.charAt(i) == s.charAt(j))
                ++j;
            pi[i] = j;
        }
        return pi;
    }

    static final ArrayList<Integer> Index = new ArrayList<Integer>();
    static final HashMap<String, Integer> h = new HashMap<String, Integer>();
    static String Input;
    static int m, max = 0;
    static String soln;
    static int[] months = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

    public static void solve(int idx) {
        String s = Input.substring(idx, idx + m);
        int year = Integer.parseInt(s.substring(6)), month = Integer.parseInt(s
                .substring(3, 5)), day = Integer.parseInt(s.substring(0, 2));
        if (year > 2015 || year < 2013 || month < 1 || month > 12 || day < 1
                || day > months[month - 1])
            return;
        Integer f = h.get(s);
        if (f != null) {
            if (max < f + 1) {
                max = f + 1;
                soln = s;
            }
            h.replace(s, f + 1);
        } else {
            if (max == 0) {
                max = 1;
                soln = s;
            }
            h.put(s, 1);
        }

    }

    public static void numberOfOcurrence(String T, String P) {
        int matched = 0;
        int[] fail = prefix_function(P);
        m = P.length();
        for (int i = 0, n = T.length(); i < n; i++) {
            while (matched > 0 && T.charAt(i) != P.charAt(matched))
                matched = fail[matched - 1];
            if (T.charAt(i) == P.charAt(matched)) {
                matched++;
                if (matched == m) {
                    solve(i - m + 1);
                    matched = fail[matched - 1];
                }
            }
        }
    }

    public static void main(String[] args) throws IOException {
        InputReader in = new InputReader(System.in);
        FastPrinter out = new FastPrinter(System.out);
        Input = in.nextLine();
        numberOfOcurrence(Input.replaceAll("[0-9]", "1"), "11-11-1111");
        out.println(soln);
        out.close();
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        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 String nextLine() {
        try {
            return reader.readLine();
        } catch (IOException e) {
            e.printStackTrace();
            return null;
        }
    }

    public int[] readIntArray(int n) {
        int[] ret = new int[n];
        for (int i = 0; i < n; i++)
            ret[i] = nextInt();
        return ret;
    }

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

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

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

    public BigInteger nextBigInt() {
        return new BigInteger(next());
    }
}

class FastPrinter extends PrintWriter {

    public FastPrinter(OutputStream out) {
        super(out);
    }

    public FastPrinter(Writer out) {
        super(out);
    }

}