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.*;
import java.util.*;
import java.util.regex.MatchResult;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Task {

	public static void main(String[] args) throws IOException {

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

		PrintWriter w = new PrintWriter(System.out);
		
		Map<String, Integer> l = new HashMap<String, Integer>();
		
		String line = reader.readLine();
		
		String key = "";
		int counts = 0;
		
		for(int i = 0; i <= line.length() - 10; i++)
		{
			String[] dt = new String[3];
			dt[0] = "";
			dt[1] = "";
			dt[2] = "";
			for(int j = 0; j < 10; j++)
			{
				if(j == 2 || j == 5)
				{
					if(line.charAt(i+j) != '-')
						break;
				}
				else if( j < 2 && line.charAt(i+j) >= '0' && line.charAt(i+j) <= '9')
				{
					dt[0] += line.charAt(i+j);
				}
				else if(j > 2 && j < 5 && line.charAt(i+j) >= '0' && line.charAt(i+j) <= '9')
				{
					dt[1] += line.charAt(i+j);
				}
				else if( j > 5 && line.charAt(i+j) >= '0' && line.charAt(i+j) <= '9')
				{
					dt[2] += line.charAt(i+j);
				}
				else
				{
					break;
				}
				if(j == 9)
				{
					i += 5;
					int day = Integer.parseInt(dt[0]);
					int month = Integer.parseInt(dt[1]);
					int year = Integer.parseInt(dt[2]);
					if(year >= 2013 && year <= 2015)
					{
						if(month >= 1 && month <= 12)
						{
							if((month <= 7 && month % 2 == 1) || (month > 7 && month %2 == 0))
							{
								if(day >= 1 && day <= 31)
								{
									String h = dt[0]+"-"+dt[1]+"-"+dt[2];
									if(l.containsKey(h))
										l.put(h, l.get(h)+1);
									else
										l.put(h, 1);
								}
							}
							else if( month == 2)
							{
								if(day >= 1 && day <= 28)
								{
									String h = dt[0]+"-"+dt[1]+"-"+dt[2];
									if(l.containsKey(h))
										l.put(h, l.get(h)+1);
									else
										l.put(h, 1);
								}
							}
							else if(day >= 1 && day <= 30)
							{
								String h = dt[0]+"-"+dt[1]+"-"+dt[2];
								if(l.containsKey(h))
									l.put(h, l.get(h)+1);
								else
									l.put(h, 1);
							}
						}
					}
					break;
				}
				
				
			}
		}
		for(String z : l.keySet())
		{
			if(counts <= l.get(z))
			{
				key = z;
				counts = l.get(z);
			}
		}
		
		w.print(key);
		w.flush();
	}

}