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.Arrays;
import java.util.Scanner;

public class Prob260B {
	public static void main(String[] Args) {
		int[] months = new int[] { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30,
				31 };

		Scanner scan = new Scanner(System.in);
		String s = scan.next();
		int numDashes = 0;
		for (int i = 0; i < s.length(); i++)
			numDashes += s.charAt(i) == '-' ? 1 : 0;

		int[] dashes = new int[numDashes];
		numDashes = 0;
		for (int i = 0; i < s.length(); i++)
			if (s.charAt(i) == '-')
				dashes[numDashes++] = i;

		int[] dates = new int[numDashes];
		int numDates = 0;

		for (int i = 1; i < numDashes; i++)
			if (dashes[i - 1] >= 2 && dashes[i] < s.length() - 4)
				if (dashes[i] - dashes[i - 1] == 3
						&& isValid(s
								.substring(dashes[i - 1] - 2, dashes[i] + 5))) {
					int date = Integer.parseInt(s.substring(dashes[i - 1] - 2,
							dashes[i - 1]));
					int month = Integer.parseInt(s.substring(dashes[i - 1] + 1,
							dashes[i]));
					int year = Integer.parseInt(s.substring(dashes[i] + 1,
							dashes[i] + 5));

					if (year >= 2013 && year <= 2015)
						if (month >= 1 && month <= 12)
							if (date >= 1 && date <= months[month - 1])
								dates[numDates++] = (month * 32 + date) * 10000
										+ year;
				}

		Arrays.sort(dates);

		int index = dates.length - numDates;
		int maxOcc = dates[index];
		int maxOccTimes = 1;

		int curOcc = dates[index];
		int curOccTimes = 1;

		for (int i = index + 1; i < dates.length; i++) {
			if (curOcc == dates[i])
				curOccTimes++;
			else {
				if (curOccTimes > maxOccTimes) {
					maxOcc = curOcc;
					maxOccTimes = curOccTimes;
				}
				curOcc = dates[i];
				curOccTimes = 1;
			}
		}

		if (curOccTimes > maxOccTimes) {
			maxOcc = curOcc;
			maxOccTimes = curOccTimes;
		}

		String date = "" + (maxOcc / 10000 % 32);
		String month = "" + (maxOcc / 10000 / 32);
		String year = "" + (maxOcc % 10000);

		if (date.length() == 1)
			date = "0" + date;
		if (month.length() == 1)
			month = "0" + month;

		System.out.println(date + "-" + month + "-" + year);
	}

	private static boolean isValid(String s) {
		int[] indices = new int[] { 0, 1, 3, 4, 6, 7, 8, 9 };
		for (int i = 0; i < indices.length; i++)
			if (!Character.isDigit(s.charAt(indices[i])))
				return false;
		return true;
	}
}
