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.BufferedReader;
import java.io.InputStreamReader;
import java.text.SimpleDateFormat;
import java.util.Calendar;
import java.util.Date;
import java.util.HashMap;
import java.util.StringTokenizer;

public class B {
	static BufferedReader stdin = new BufferedReader(new
			InputStreamReader(System.in));
	static StringTokenizer st = new StringTokenizer("");
	static HashMap<Date, Integer> hm = new HashMap<Date, Integer>();
	static SimpleDateFormat sdf = new SimpleDateFormat("dd-MM-yyyy");
	static char[] carr = {};
	
	public static void main(String[] args) throws Exception {
		sdf.setLenient(false);
		carr = readString().toCharArray();
		for (int i = 0; i < carr.length; i++){
			if (carr[i] == '-')
				addIfLegal(i-2);
		}
		int best = 0;
		Date b = null;
		for (Date d : hm.keySet()){
			int cur = hm.get(d);
			if (best < cur){
				b = d;
				best = cur;
			}
		}
		Calendar c = Calendar.getInstance();
		c.setTime(b);
		System.out.printf("%02d-%02d-%04d\n", c.get(Calendar.DAY_OF_MONTH), c.get(Calendar.MONTH)+1,
				c.get(Calendar.YEAR));
	}
	
	static void addIfLegal(int start){
		if (start < 0 ||
		    carr.length <= start + 9 ||
		    carr[start+2] != '-' || carr[start+5] != '-') return;
		try {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < 10; i++)
				sb.append(carr[start+i]);
			Date d = sdf.parse(sb.toString());
			if (d != null){
				if ((2012-1900) < d.getYear() && d.getYear() < (2016-1900)){
					if (!hm.containsKey(d)){
						hm.put(d, 0);
					}
					hm.put(d, hm.get(d)+1);
				}
			}
		} catch (Exception e){
			
		}
	}
	
	static String readString() throws Exception {
		while (!st.hasMoreTokens()) {
			st = new StringTokenizer(stdin.readLine());
		}
		return st.nextToken();
	}
	
	static int readInt() throws Exception {
		return Integer.parseInt(readString());
	}
	
	static long readLong() throws Exception {
		return Long.parseLong(readString());
	}
	
	static double readDouble() throws Exception {
		return Double.parseDouble(readString());
	}
}
