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.*;
import java.io.*;
public class B {
	int[] days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	public void solve() throws IOException {
		String string = nextToken();
		char[] str = string.toCharArray();
		char zero = '0';
		boolean[] num = new boolean[str.length];
		for(int i = 0; i < str.length; i++){
			if( Character.isDigit(str[i]) ){
				num[i] = true;
			}
		}
		int max = 0;
		String ans = new String();
		int[][][] map = new int[3][13][32];
	out:
		for(int i = 0; i < str.length-9; i++){
	//		writer.println(string.substring(i, i+10));
			if( str[i+2] != '-' && str[i+5] != '-' ){
				continue;
			}
			for(int j = 0; j < 10; j++){
				if( j == 2 || j == 5 ){
					if( num[i+j] ){
						continue out;	
					}
					continue;
				}
				if( !num[i+j] ){
					continue out;
				}
			}
			int year = str[i+6]*1000+str[i+7]*100+str[i+8]*10+str[i+9]-1111*zero;
			int day = str[i]*10+str[i+1]-11*zero;
			int month = str[i+3]*10+str[i+4]-11*zero;
	//		writer.println(string.substring(i, i+10) + " " + year + " " + month + " " + day);
			if( year < 2013 || year > 2015 || month < 1 || month > 12 ){
				continue;
			}
			if( day >= 1 && day <= days[month-1] ){
				String sub = string.substring(i, i+10);
				map[year-2013][month][day]++;
				if( max < map[year-2013][month][day] ){
					max = map[year-2013][month][day];
					ans = sub;
				}
			}
		}
		writer.println(ans);
	}

	public static void main(String[] args) throws IOException {
		new B().run();
	}

	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;

	public void run() throws IOException {
		try {
			reader = new BufferedReader(new InputStreamReader(System.in));
			tokenizer = null;
			writer = new PrintWriter(System.out);
			solve();
			reader.close();
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	public String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}

}
