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.*;
import java.io.*;
import java.math.*;

public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Solver solver = new Solver();
		solver.solve(in, out);
		out.close();
	}
}

class Solver {
	private static final int L = 10;
	private int[] months = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	public boolean isDate(String s) {
		if (s == null)
			return false;
		if (s.length() != L)
			return false;
		for (int i = 0; i < s.length(); i++) {
			if (s.charAt(i) == '-') {
				if (i == 2 || i == 5)
					continue;
				else
					return false;
			}
		}
		StringTokenizer tok = new StringTokenizer(s, "-");
		int day, month, year;
		try{
			day = Integer.parseInt(tok.nextToken());
			month = Integer.parseInt(tok.nextToken());
			year = Integer.parseInt(tok.nextToken());
		} catch(Exception e) {
			return false;
		}
		if (month < 1 || month > 12)
			return false;
		month--;
		if (day < 1 || day > months[month])
			return false;
		if (year < 2013 || year > 2015)
			return false;
		return true;
	}
	public void solve(InputReader in, PrintWriter out) {
		String text;
		text = in.next();
		TreeMap<String, Integer> use = new TreeMap<String, Integer>();
		for (int i = 0; i <= text.length() - L; i++) {
			String sub = text.substring(i, i + L);
			if (isDate(sub)) {
				if (use.containsKey(sub)) {
					use.put(sub, use.get(sub) + 1);
				} else {
					use.put(sub, 1);
				}
			}
		}
		String ans = "";
		int mx = -1;
		for (Map.Entry<String, Integer> entry : use.entrySet()) {
			if (entry.getValue() > mx) {
				mx = entry.getValue();
				ans = entry.getKey();
			}
		}
		out.println(ans);
	}
}

class InputReader {
	private BufferedReader reader;
	private StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
