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.*;
public class AncientProphesy
{
	public static final int[] months = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		
		String line = in.next();
		
		int[][][] dates = new int[32][13][4];
		
		for(int x = 0; x <= line.length() - 10; x++)
		{
			int[] date = getDate(line.substring(x, x + 10));
			
			if(date[0] != -1)
			{
				dates[date[0]][date[1]][date[2]]++;
			}
		}
		
		int[] best = new int[3];
		Arrays.fill(best, -1);
		int max = 0;
		for(int y = 0; y < dates.length; y++)
		{
			for(int z = 0; z < dates[0].length; z++)
			{
				for(int a = 0; a < dates[0][0].length; a++)
				{
					if(dates[y][z][a] > max)
					{
						max = dates[y][z][a];
						best[0] = y;
						best[1] = z;
						best[2] = a;
					}
				}
			}
		}
		
		System.out.printf("%02d-%02d-%d\n", best[0], best[1], best[2] + 2012);
	}
	
	public static int[] getDate(String line)
	{
		int[] ret = new int[3];
		
		if(line.charAt(2) == '-' && line.charAt(5) == '-')
		{
			try
			{
				ret[0] = Integer.parseInt(line.substring(0, 2));
				ret[1] = Integer.parseInt(line.substring(3, 5));
				ret[2] = Integer.parseInt(line.substring(6));
				ret[2] -= 2012;
				
				if(ret[1] >= 1 && ret[1] <= 12 && ret[0] >= 1 && ret[0] <= months[ret[1] - 1] && ret[2] >= 1 && ret[2] <= 3)
				{
					return ret;
				}
			}
			catch(NumberFormatException ex)
			{
				
			}
		}
		
		Arrays.fill(ret, -1);
		return ret;
	}
}
