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.awt.*;
import java.awt.event.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;

public class B {
	static BufferedReader br;
	static StringTokenizer st;
	static PrintWriter pw;

	static int[] max = new int[]{0,31,28,31,30,31,30,31,31,30,31,30,31};
	
	public static void main(String[] args) throws IOException	{
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		String str = nextToken();
		HashMap<String, Integer> count = new HashMap<String, Integer>();
		int max = 0;
		String best = "";
		for(int i = 0; i + 10 <= str.length(); i++)	{
			String portion = str.substring(i,i+10);
			if(valid(portion))	{
				Integer now = count.get(portion);
				if(now == null)
					now = 0;
				count.put(portion, ++now);
				if(now > max)	{
					max = now;
					best = portion;
				}
			}
		}
		pw.println(best);
		pw.close();
	}

	public static boolean valid(String date)	{
		boolean[] hyphen = new boolean[10];
		hyphen[2] = hyphen[5] = true;
		for(int i = 0; i < date.length(); i++)	{
			if((date.charAt(i) == '-') != hyphen[i])	{
				return false;
			}
		}
		int year = Integer.parseInt(date.substring(6));
		if(year < 2013 || year > 2015)
			return false;
		int month = Integer.parseInt(date.substring(3,5));
		if(month < 1 || month > 12)
			return false;
		int day = Integer.parseInt(date.substring(0,2));
		if(day < 1 || day > max[month])
			return false;
		return true;
	}
	
	public static long readLong() throws IOException	{
		return Long.parseLong(nextToken());
	}
	public static double readDouble() throws IOException	{
		return Double.parseDouble(nextToken());
	}
	public static int readInt() throws IOException	{
		return Integer.parseInt(nextToken());
	}
	public static short readShort() throws IOException	{
		return Short.parseShort(nextToken());
	}
	public static String nextToken() throws IOException	{
		while(st == null || !st.hasMoreTokens())	{
			if(!br.ready())	{
				pw.close();
				System.exit(0);
			}
			st = new StringTokenizer(br.readLine().trim());
		}
		return st.nextToken();
	}
}

