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

public class Pr260B {
	public static void main(String[] args) throws IOException {
		new Pr260B().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st;

	String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(in.readLine());
		}
		return st.nextToken();
	}

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

	void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out, true);
		solve();
		out.flush();
	}

	boolean isDate(String a) {
		if (a.charAt(0) != '-' && a.charAt(1) != '-') {
			if (a.charAt(2) == '-') {
				if (a.charAt(3) != '-' && a.charAt(4) != '-') {
					if (a.charAt(5) == '-') {
						if (a.charAt(6) != '-' && a.charAt(7) != '-'
								&& a.charAt(8) != '-' && a.charAt(9) != '-') {
							return true;
						}
					}
				}
			}
		}
		return false;
	}

	void isCorrectDate(String a) {
		int day = Integer.parseInt(a.substring(0, 2));
		int mouth = Integer.parseInt(a.substring(3, 5));
		int year = Integer.parseInt(a.substring(6, 10));
		if (year >= 2013 && year <= 2015) {
			if (mouth >= 1 && mouth <= 12) {
				if (dayIsForMouth(day, mouth)) {
					dif.add(a);
				}
			}
		}
	}

	boolean dayIsForMouth(int d, int m) {
		if (m <= 7) {
			if (m % 2 == 1) {
				return d > 0 && d <= 31;
			}
			if (m == 2) {
				return d > 0 && d <= 28;
			}
			return d > 0 && d <= 30;
		}
		if (m % 2 == 0) {
			return d > 0 && d <= 31;
		}
		return d > 0 && d <= 30;
	}

	ArrayList<String> dif;

	void solve() throws IOException {
		String s = nextToken();
		dif = new ArrayList<String>();
		for (int i = 0; i <= s.length() - 10; i++) {
			if (isDate(s.substring(i, i + 10))) {
				isCorrectDate(s.substring(i, i + 10));
			}
		}
		Collections.sort(dif);
		int mcnt = 1;
		String best = dif.get(0);
		int cnt = 1;
		for (int i = 1; i < dif.size(); i++) {
			if (dif.get(i).equals(dif.get(i - 1))) {
				cnt++;
				if (cnt > mcnt) {
					mcnt = cnt;
					best = dif.get(i);
				}
			} else {
				cnt = 1;
			}
		}
		out.println(best);
	}
}
