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.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;

public class B {

	final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok = new StringTokenizer("");

	void solve() throws IOException {
		char[] s = readString().toCharArray();
		TreeMap<String, Integer> count = new TreeMap<String, Integer>();
		
		int n = s.length;
		for(int i = 0; i < n - 9; i++){
			String c = new String();
			for(int j = 0; j < 10; j++){
				c += s[i+j];
			}
			if(check(c.toCharArray())){
				if(count.containsKey(c)){
					int cur = count.get(c);
					count.remove(c);
					count.put(c, cur+1);
				}
				else{
					count.put(c, 1);
				}
			}
		}
		
		String max = "";
		int mx = 0;
		for(String x: count.keySet()){
			int cur = count.get(x);
			if(cur > mx){
				mx = cur;
				max = x;
			}
		}
		out.println(max);
	}
	
	boolean check(char[] c){
		for(int i = 0; i < c.length; i++){
			if(!Character.isDigit(c[i]) && i != 2 && i != 5)
				return false;
			if(c[i] != '-' && (i == 2 || i == 5)) return false;
		}
		int day = 10 * (c[0]-'0') + (c[1]-'0');
		int month = 10*(c[3]-'0') + (c[4]-'0');
		int year = 1000*(c[6]-'0') + 100*(c[7]-'0') + 10*(c[8]-'0') + (c[9]-'0');
		if(year < 2013 || year > 2015) return false;
		if(month < 1 || month > 12) return false;
		int[] m = {31,28,31,30,31,30,31,31,30,31,30,31};
		if(day < 1 || day > m[month-1]) return false;
		return true;
	}

	void init() throws FileNotFoundException {
		if (ONLINE_JUDGE) {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
		} else {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter("output.txt");
		}
	}

	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	long readLong() throws IOException {
		return Long.parseLong(readString());
	}

	double readDouble() throws IOException {
		return Double.parseDouble(readString());
	}

	int[] readArr(int n) throws IOException {
		int[] res = new int[n];
		for (int i = 0; i < n; i++) {
			res[i] = readInt();
		}
		return res;
	}

	long[] readArrL(int n) throws IOException {
		long[] res = new long[n];
		for (int i = 0; i < n; i++) {
			res[i] = readLong();
		}
		return res;
	}

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

	public void run() {
		try {
			long t1 = System.currentTimeMillis();
			init();
			solve();
			out.close();
			long t2 = System.currentTimeMillis();
			System.err.println("Time = " + (t2 - t1));
		} catch (Exception e) {
			e.printStackTrace(System.err);
			System.exit(-1);
		}
	}
}