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.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.TreeMap;
public class AncientProphesy {
	public static void main(String[]args)throws IOException{
		BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
		String s=bf.readLine();
		TreeMap<String, Integer> map=new TreeMap<String, Integer>();
		int max=0;
		String ans="";
		for(int i=0;i<s.length()-9;i++){
			String t=s.substring(i, i+10);
			if(map.containsKey(t)){
				int occ=map.get(t);
				if(occ+1>max){
					max=occ+1;
					ans=t;
				}
				map.put(t, occ+1);
			}
			else{
				if(valid(t)){
					map.put(t, 1);
					if(max==0){
						max=1;
						ans=t;
					}
				}
			}
		}
		System.out.println(ans);
	}
	
	public static boolean valid(String s){
		String[]sa=s.split("-");
		if(sa.length==3){
			for(int i=0;i<3;i++){
				if(sa[i].length()<2)
					return false;
				for(int j=0;j<sa[i].length();j++)
					if(!Character.isDigit(sa[i].charAt(j)))
						return false;
			}
			int d=Integer.parseInt(sa[0]);
			int m=Integer.parseInt(sa[1]);
			int y=Integer.parseInt(sa[2]);
			boolean f=true;
			f=f && y>=2013 && y<=2015 && m>=1 && m<=12;
			f=f && valid(d,m);
			return f;
		}
		return false;
	}
	
	public static boolean valid(int d,int m){
		switch (m){
		case 2: return (d>=1 && d<=28);
		case 4:
		case 6:
		case 9:
		case 11: return (d>=1 && d<=30);
		default: return (d>=1 && d<=31);
		}
	}
}