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.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {
	int[] dom = new int[]{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	int[] cumdom = new int[]{0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365};
	
	public void solve(){
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));		
		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] subinput = input.split("-");
		
		
		int[] ans = new int[365*4];
		
		for(int i = 0; i < subinput.length; i++){
			if(i < 2) continue;
			
			if( subinput[i].length() >= 4){
				int year = Integer.parseInt( subinput[i].substring(0,4) );
				if(year >= 2013 && year <= 2015){
					if( subinput[i-1].length() == 2){
						int month = Integer.parseInt( subinput[i-1]);
						if( month >= 1 && month <= 12){
							if( subinput[i-2].length() >= 2){
								String s = subinput[i-2].substring( subinput[i-2].length()-2, subinput[i-2].length() );
								int day = Integer.parseInt( s );
								if( day > 0 && day <= dom[month]){
									ans[datetonum(year, month, day)]++;
								}
							}
						}
					}
				}
			}	
//			System.out.println( subinput[i]);
		}
		
		int max = Integer.MIN_VALUE;
		int maxdate = -1;
		for(int i = 0; i < ans.length; i++){
			if( ans[i] > max){
				max = ans[i];
				maxdate = i;
			}
		}
		System.out.println( numtodate(maxdate) );
	}
	public String numtodate(int num){
		int year = num / 365 + 2013;
		int month = 0;
		int day = 0;
		num %= 365;
		for(int m = 1; m <= 12; m++){
			if( cumdom[m] > num){
				month = m;
				day = num - cumdom[m-1] + 1;
				break;
			}
		}
		return (day>9?"":"0") + day + "-" + (month>9?"":"0") + month + "-" + year;
	}
	public int datetonum(int year, int month, int day){
		return (year-2013)*365 + cumdom[month-1] + day-1;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new B().solve();
	}

}
