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.PriorityQueue;
import java.util.Scanner;


public class Codeforces {
	static PriorityQueue<String> PQ;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String in = sc.next();
		PQ = new PriorityQueue<String>();
		int L = "01-01-2013".length();
		for(int a=0;a<=in.length()-L;a++){
			if(valid(""+in.subSequence(a, a+L)))
			{
				PQ.add(""+in.subSequence(a, a+L));
			}
		}
		String best = "";
		String cur = "";
		int bestmany = 0;
		int curmany = 0;
		
		while(!PQ.isEmpty()){
			
			String temp = PQ.poll();;
			if(temp.compareTo(cur)==0)curmany++;
			else{
				if(bestmany<curmany){
					bestmany=curmany;
					best = cur;
				}
				cur = temp;
				curmany = 1;
			}
		}
		if(bestmany<curmany){
			bestmany=curmany;
			best = cur;
		}
		System.out.println(best);

	}
	private static boolean valid(String test) {
	//	System.out.println(test);
		String[] out = test.split("-");
		if(out.length!=3)return false;
		if(out[0].length()!=2)return false;
		if(out[1].length()!=2)return false;
		if(out[2].length()!=4)return false;
		try{
			int d = Integer.parseInt(out[0]);
			int m = Integer.parseInt(out[1]);
			int y = Integer.parseInt(out[2]);
			if(m>=1&&m<=12&&d>=1&&d<=31&&y>=2013&&y<=2015){
				switch (m){
				case 2: if(d>28)return false;
				case 4:
				case 6:
				case 9:
				case 11: if(d==31)return false;
				default: return true;
				}
			}
		}
		catch(Exception e){
			return false;
		}
		
		return false;
	}

}
