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.TreeMap;
import java.util.Map.Entry;

public class AncientProphesy {
	static String s;

	static int days(int x)
	{
		if(x==2)
			return 28;
		if(x==1 || x==3 || x==5 || x==7 ||x==8 ||x==10 ||x==12)
			return 31;
		else
			return 30;
	}

	static boolean isValid(int i)
	{
		if(s.charAt(i+2)!='-' || s.charAt(i+5)!='-')
			return false;
		try
		{
		int month = Integer.parseInt(s.substring(i+3,i+5));
		if(month>12 || month<1 )
			return false;


		int day = Integer.parseInt(s.substring(i,i+2));
		if(day<1 || day>days(month))
			return false;

		int year = Integer.parseInt(s.substring(i+6,i+10));
		if(year>2015 || year<2013 )
			return false;
		}
		catch(Exception e)
		{
			return false;
		}
		return true;

	}


	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		s = sc.nextLine();
		TreeMap<String,Integer> map = new TreeMap<String,Integer>();
		for(int i=0;i<s.length()-9;i++)
		{
			if(isValid(i))
			{
				String ss = s.substring(i,i+10);
				if(!map.containsKey(ss))
					map.put(ss, 1);
				else
					map.put(ss, map.get(ss)+1);
			}
		}
		String date = "";
		int max = -1;
		for(Entry<String, Integer> ent : map.entrySet())
		{
			if(ent.getValue()>max)
				date = ent.getKey();
			max = Math.max(max, ent.getValue());
		}
		System.out.println(date);
		
			
	}

}
