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


public class TaskB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		TaskB solver = new TaskB();
		solver.solve(in, out);
		in.close();
		out.close();
	}
	
	private static final int[] months = 
		{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	private int[][][] counter = new int[35][15][5];
	private int max = 0;
	private String prophecy;
	private String current;
	private int lastDay, lastMonth, lastYear;
	
	private void solve(Scanner in, PrintWriter out) {
		prophecy = in.next();
		int last = prophecy.length() - 9;
		boolean bad;
		for (int i = 0; i < last; ++i) {
			current = prophecy.substring(i, i + 10);
			bad = false;
			for (int j = 0; j < 10; ++j)
				if (j != 5 && j != 2) {
					if (!(current.charAt(j) <= '9') || !(current.charAt(j) >= '0')) {
						bad = true;
						break;
					}
				} else if (current.charAt(j) != '-') {
					bad = true;
					break;
				}
			if (bad)
				continue;
			int day = 10 * (current.charAt(0) - '0') + (current.charAt(1) - '0');
			int month = 10 * (current.charAt(3) - '0') + (current.charAt(4) - '0');
			int year = 1000 * (current.charAt(6) - '0') + 100 * (current.charAt(7) - '0') +
					10 * (current.charAt(8) - '0') + (current.charAt(9) - '0');
			if (isValid(day, month, year)) {
				++counter[day][month][year - 2013];
				if (counter[day][month][year - 2013] > max) {
					max = counter[day][month][year - 2013];
					lastDay = day;
					lastMonth = month;
					lastYear = year;
				}
			}
		}
		out.print(lastDay / 10);
		out.print(lastDay % 10);
		out.print("-");
		out.print(lastMonth / 10);
		out.print(lastMonth % 10);
		out.print("-");
		out.print(lastYear);
	}
	
	private boolean isValid(int day, int month, int year) {
		return (month > 0 && month < 13) && (day > 0 && day <= months[month]) && 
				(year < 2016 && year > 2012);
	}

}
