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
// practice with kaiboy
import java.io.*;
import java.util.*;

public class CF260B extends PrintWriter {
	CF260B() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF260B o = new CF260B(); o.main(); o.flush();
	}

	byte[] cc;
	int[] dd = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	boolean check(int i) {
		if (cc[i + 2] != '-' || cc[i + 5] != '-')
			return false;
		if (cc[i + 6] != '2' || cc[i + 7] != '0' || cc[i + 8] != '1' || cc[i + 9] < '3' || cc[i + 9] > '5')
			return false;
		if (cc[i] == '-' || cc[i + 1] == '-' || cc[i + 3] == '-' || cc[i + 4] == '-')
			return false;
		int d = (cc[i] - '0') * 10 + (cc[i + 1] - '0');
		int m = (cc[i + 3] - '0') * 10 + (cc[i + 4] - '0');
		return m >= 1 && m <= 12 && d >= 1 && d <= dd[m];
	}
	void main() {
		cc = sc.next().getBytes();
		int n = cc.length;
		HashMap<String, Integer> mp = new HashMap<>();
		String s_ = null;
		int k_ = 0;
		for (int i = 0; i + 10 <= n; i++)
			if (check(i)) {
				String s = new String(cc, i, 10);
				int k = mp.getOrDefault(s, 0) + 1;
				mp.put(s, k);
				if (k_ < k) {
					k_ = k;
					s_ = s;
				}
			}
		println(s_);
	}
}
