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.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {

	
	
	public static String lastOf(String s,int n){
		if(s.length()<n) return "-1";
		return s.substring(s.length()-n);
	}

	public static void main(String[] args) {
		Scanner cin=new Scanner(System.in);
		String s=cin.next();
		String arr[]=s.split("-");
		HashMap<String, Integer>  M=new HashMap<String,Integer>();
		int md[]=new int[]{0,31,28,31,30,31,30,31,31,30,31,30,31};
		for(int i=0;i<arr.length-2;i++){
			if(arr[i].length()>=2 && arr[i+1].length()==2 && arr[i+2].length()>=4) {
				String ds=lastOf(arr[i],2);
				String ms=arr[i+1];
				String ys=arr[i+2].substring(0, 4);
				String ss=ds+"-"+ms+"-"+ys;
				int y=Integer.valueOf(ys);
				int m=Integer.valueOf(ms);
				int d=Integer.valueOf(ds);
				if(y>=2013 && y<=2015 && m>=1 && m<=12 && d>0 && d<=md[m]){
					M.put(ss, M.get(ss)==null?1:M.get(ss)+1);
				}
			}
		}
		String ans="";
		int tmax=-1;
		for(Iterator iter=M.entrySet().iterator();iter.hasNext();){
			 Entry entry = (Entry)iter.next();
			if((Integer)entry.getValue()>tmax){
				tmax=(Integer)entry.getValue();
				ans=(String)entry.getKey();
			}
		}
		System.out.println(ans);
		
		
	}

}
