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

public class AncientProphesy {
	
	static final int DATE_LEN = 10; // dd-mm-yyyy
	static final int[] DAYS_PER_MONTH = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	
	static boolean isValid(String date) {
		String[] parts = date.split("-");
		if (parts.length != 3) return false;
		if (parts[0].length() != 2 || parts[1].length() != 2 || parts[2].length() != 4) return false;
		int day = Integer.parseInt(parts[0]);
		int month = Integer.parseInt(parts[1]);
		int year = Integer.parseInt(parts[2]);
		
		return year >= 2013 && year <= 2015 && month >= 1 && month <= 12 && day > 0 && day <= DAYS_PER_MONTH[month - 1];
	}
	
	static String solve(String prophesy) {
		Map<String, Integer> count = new HashMap<String, Integer>();
		
		String apocalypseDate = "";
		count.put(apocalypseDate, 0);
		for (int i = 0; i + DATE_LEN <= prophesy.length(); ++i) {
			String candidate = prophesy.substring(i, i + DATE_LEN);
			if (isValid(candidate)) {
				if (!count.containsKey(candidate)) {
					count.put(candidate, 0);
				}
				count.put(candidate, count.get(candidate) + 1);
				if (count.get(candidate) > count.get(apocalypseDate)) {
					apocalypseDate = candidate;
				}
			}
		}
		
		return apocalypseDate;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		String prophesy = in.next();
		System.out.println(solve(prophesy));
		
		in.close();
		System.exit(0);
	}
}
