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.*;

public class code
{
	static class node implements Comparable<node>
	{
		String date;
		int count;

		node(String d, int cnt)
		{
			date = d;
			count = cnt;
		}

		@Override
		public int compareTo(node o)
		{
			return this.count - o.count;
		}
	}
	public static void main(String[] args)
	{
		int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
		Scanner scan = new Scanner(System.in);

		String date = scan.nextLine().trim();

		ArrayList<node> dates = new ArrayList<node>();

		for(int i = 0; i+10 <= date.length(); i++)
		{
			String sub = date.substring(i, i+10);
			if(count(sub) != 2)
				continue;

			String [] tokens = sub.split("-");

			if(tokens.length != 3)
				continue;
			if(tokens[0].length() != 2 || tokens[1].length() != 2 || tokens[2].length() != 4)
				continue;
			if(!(isInt(tokens[0]) && isInt(tokens[1]) && isInt(tokens[2])))
				continue;
			if(!(Integer.parseInt(tokens[2]) >= 2013 && Integer.parseInt(tokens[2]) <= 2015))
				continue;
			if(Integer.parseInt(tokens[1]) <= 0 || Integer.parseInt(tokens[1]) > 12)
				continue;
			if(Integer.parseInt(tokens[0]) <= 0 || Integer.parseInt(tokens[0]) > day[Integer.parseInt(tokens[1])])
				continue;

			int idx;
			if((idx = contain(dates, sub)) != -1)
				dates.get(idx).count++;
			else
				dates.add(new node(sub, 1));

		}
		Collections.sort(dates);
		System.out.println(dates.get(dates.size()-1).date);

	}

	private static int count(String sub)
	{
		int cnt = 0;
		for(int i = 0; i < sub.length(); i++)
			if(sub.charAt(i) == '-')
				cnt++;
		return cnt;
	}

	private static int contain(ArrayList<node> dates, String str)
	{
		for(int i = 0; i < dates.size(); i++)
			if(dates.get(i).date.equals(str))
				return i;
		return -1;
	}

	private static boolean isInt(String token)
	{
		if(token.isEmpty() || token.contains("-"))
			return false;

		for(int i = 0; i < token.length(); i++)
			if(token.charAt(i) < '0' || token.charAt(i) > '9')
				return false;
		return true;
	}
}
