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.Collections;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Scanner;


public class Main {

	static String getCorrectSub(String str, int index) {
		if (str.charAt(index+2) != '-' || str.charAt(index+5) != '-')
			return null;
		try {
			int d = Integer.parseInt("" + str.charAt(index) + str.charAt(index+1));
			int m = Integer.parseInt("" + str.charAt(index+3) + str.charAt(index+4));
			int y = Integer.parseInt("" + str.charAt(index+6) + str.charAt(index+7) + str.charAt(index+8) + str.charAt(index+9));
			if (y < 2013 || y > 2015)
				return null;
			if (m < 1 || m > 12)
				return null;
			switch(m) {
			case 1:
			case 3:
			case 5:
			case 7:
			case 8:
			case 10:
			case 12:
				if (d > 31 || d < 1)
					return null;
				break;
			case 2:
				if (d > 28 || d < 1)
					return null;
				break;
			default:
				if (d > 30 || d < 1)
					return null;
			}
			return str.substring(index, index+10);
		} catch (NumberFormatException e) {
			return null;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();
		HashMap<String, Integer> map = new HashMap<String, Integer>();
		for (int i = 0; i < str.length()-9; ++i) {
			String sub = getCorrectSub(str, i);
			if (sub == null)
				continue;
			if (map.get(sub) != null) {
				map.put(sub, map.get(sub)+1);
			} else {
				map.put(sub, 0);
			}
		}
		int max = -1;
		String res = null;
		for (Entry<String, Integer> e : map.entrySet()) {
			if (e.getValue() > max) {
				max = e.getValue();
				res = e.getKey();
			}
		}
		System.out.println(res);
		
	}

}
