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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class B {
	public static void main(String[] args) {
		BufferedReader buf = new BufferedReader(
				new InputStreamReader(System.in));
		String s = "";
		try {
			s = buf.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		int[] pole = new int[s.length()];
		List<String> list = new ArrayList<String>();
		for (int i = 0; i < pole.length; i++) {
			if (s.charAt(i) == '-')
				pole[i] = -1;
			else
				pole[i] = Integer.parseInt(s.charAt(i) + "");
		}
		for (int i = 0; i < pole.length - 9; i++) {
			if (pole[i + 2] == -1 && pole[i + 5] == -1 && pole[i] != -1
					&& pole[i + 1] != -1 && pole[i + 3] != -1
					&& pole[i + 4] != -1 && pole[i + 6] != -1
					&& pole[i + 7] != -1 && pole[i + 8] != -1
					&& pole[i + 9] != -1) {
				int mesiac = Integer.parseInt(pole[i + 3] + "" + pole[i + 4]);
				if (mesiac < 1 || mesiac > 12)
					continue;
				int rok = Integer.parseInt(pole[i + 6] + "" + pole[i + 7] + ""
						+ pole[i + 8] + "" + pole[i + 9]);
				if (rok < 2013 || rok > 2015)
					continue;
				int den = Integer.parseInt(pole[i] + "" + pole[i + 1]);
				if (den < 1 || den > 31)
					continue;
				if (mesiac == 2)
					if (den > 28)
						continue;
				if (!(mesiac == 1 || mesiac == 3 || mesiac == 5 || mesiac == 7
						|| mesiac == 8 || mesiac == 10 || mesiac == 12)) {
					if (den > 30)
						continue;
				}
				String datum = "";
				for (int j = 0; j < 10; j++) {
					if(pole[i+j]!=-1)
						datum += (pole[i + j]);
					else datum+="-";
				}
				list.add(datum);
			}
		}
		Collections.sort(list);
		String akt = -1 + "";
		int pocet = 0;
		int maxPocet = 0;
		String cislomax = -1 + "";
		for (int i = 0; i < list.size(); i++) {
			if (list.get(i).equals(akt)) {
				pocet++;
			} else {
				if (pocet >= maxPocet) {
					maxPocet = pocet;
					cislomax = akt;
				}
				akt = list.get(i);
				pocet = 0;
			}
		}
		if (pocet >= maxPocet) {
			maxPocet = pocet;
			cislomax = akt;
		}

		String vyst = cislomax;
		if (!cislomax.equals(-1 + ""))
			System.out.println(vyst);
	}
}
