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.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author PM
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
    class AlgoZZ {
        public int[] solve(char[] s) {
            int n = s.length;
            int[] z = new int[n];
            int L = 0, R = 0;
            for (int i = 1; i < n; i++) {
                if (i > R) {
                    L = R = i;
                    while (R < n && s[R-L] == s[R]) R++;
                    z[i] = R-L; R--;
                } else {
                    int k = i-L;
                    if (z[k] < R-i+1) z[i] = z[k];
                    else {
                        L = i;
                        while (R < n && s[R-L] == s[R]) R++;
                        z[i] = R-L; R--;
                    }
                }
            }
            return z;
        }
        public boolean[] findOccurances(String S, String T) {
            StringBuilder sb = new StringBuilder(T);
            sb.append("#");
            sb.append(S);
            String SS = sb.toString();
            int[] z = solve(SS.toCharArray());
            boolean[] res = new boolean[S.length()];
            for (int at = T.length(); at < SS.length(); at++) {
                if (z[at]==T.length()) res[at - T.length()] = true;
            }
            return res;
        }
    }

    int[] days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        String apo = in.next();
        String best = "";
        int bestcnt = -1;
        for (int y = 2013; y < 2016; y++) {
            for (int m = 1; m < 13; m++) {
                for (int d = 1; d <= days[m - 1]; d++) {
                    StringBuilder sb = new StringBuilder();
                    if (d < 10) sb.append('0');
                    sb.append(d + "-");
                    if (m < 10) sb.append('0');
                    sb.append(m + "-");
                    sb.append(Integer.toString(y));
boolean[] occ = new AlgoZZ().findOccurances(apo,sb.toString());
                    int cnt = 0;
                    for (int i = 0; i < occ.length; i++) if (occ[i]) ++cnt;
                    if (cnt>bestcnt) {
                        bestcnt = cnt;
                        best = sb.toString();
                    }
                }
            }
        }
        out.println(best);
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 8192);
        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();
    }

}

