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.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class ProblemB {
	static final int[] monthDay = {
		0,
		31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
	};
	
	static class Date implements Comparable<Date> {
		int day;
		int month;
		int year;
		Date(String s) {
			try {
				day = Integer.valueOf(s.substring(0, 2));
				month = Integer.valueOf(s.substring(3, 5));
				year = Integer.valueOf(s.substring(6, 10));
				if (s.charAt(2) != '-' || s.charAt(5) != '-') {
					throw new Exception();
				}
				int ct = 0;
				for (int c = 0 ; c < 10 ; c++) {
					if (s.charAt(c) == '-') {
						ct++;
					}
				}
				if (ct != 2) {
					throw new Exception();
				}
				if (2013 <= year && year <= 2015) {
				} else {
					throw new Exception();
				}
				if (1 <= month && month <= 12) {
				} else {
					throw new Exception();
				}
				if (1 <= day && day <= monthDay[month]) {
				} else {
					throw new Exception();
				}
			} catch (Exception e) {
				day = month = year = -1;
			}
		}
		@Override
		public int compareTo(Date arg0) {
			return Long.signum(encode() - arg0.encode());
		}
		
		public long encode() {
			return 1L * year * 10000 + 1L * month * 100 + day;
		}
	}
	
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Map<Long, Integer> map = new HashMap<Long, Integer>();
		String line = in.nextLine();
		int len = line.length();
		Date best = null;
		for (int i = 0 ; i <= len - 10 ; i++) {
			Date date = new Date(line.substring(i, i+10));
			if (date.day != -1) {
				long code = date.encode();
				if (!map.containsKey(code)) {
					map.put(code, 0);
				}
				map.put(code, map.get(code) + 1);
				if (best == null || map.get(best.encode()) < map.get(code)) {
					best = date;
				}
			}
		}
		
		out.println(String.format("%02d-%02d-%04d", best.day, best.month, best.year));
		out.flush();
	}
	
	public static void debug(Object... o) {
		System.err.println(Arrays.deepToString(o));
	}
}

