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.Scanner;
import java.util.Map;
import java.io.IOException;
import java.util.Calendar;
import java.util.HashMap;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
	public void solve(int testNumber, Scanner in, PrintWriter out) {
		String s = in.next();
		Map<String, Integer> map = new HashMap<String, Integer>();
		for (int i = 0; i + 10 <= s.length(); ++i) {
			String dateStr = s.substring(i, i + 10);
			StringTokenizer st = new StringTokenizer(dateStr, "-");
			if (st.countTokens() != 3) continue;
			String ds = st.nextToken();
			if (ds.length() != 2) continue;
			String ms = st.nextToken();
			if (ms.length() != 2) continue;
			String ys = st.nextToken();
			if (ys.length() != 4) continue;
			int d = Integer.parseInt(ds);
			int m = Integer.parseInt(ms);
			int y = Integer.parseInt(ys);
			if (2013 <= y && y <= 2015)
				if (1 <= m && m <= 12) {
					Calendar calendar = Calendar.getInstance();
					int year = y;
					int month = m - 1;
					int date = 1;
					calendar.set(year, month, date);
					int days = calendar.getActualMaximum(Calendar.DAY_OF_MONTH);
					if (1 <= d && d <= days) {
						if (map.containsKey(dateStr)) {
							int cnt = map.get(dateStr);
							map.put(dateStr, cnt + 1);
						} else {
							map.put(dateStr, 1);
						}
					}
				}
		}
		int cnt = 0;
		String res = "";
		for (String key : map.keySet()) {
			if (map.get(key) > cnt) {
				cnt = map.get(key);
				res = key;
			}
		}
		out.println(res);
	}
}

