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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;


public class B {
	
	static StringTokenizer st;
	static BufferedReader in;
	public static void main(String[] args) throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		String s = next();
		Map<String, Integer> map = new HashMap<String, Integer>();
		for (int i = 0; i <= s.length()-10; i++) {
			String []ss = s.substring(i, i+10).split("-");
			String w = s.substring(i, i+10);
			if (w.startsWith("-") || w.endsWith("-"))
				continue;
			if (ss.length==3 && ss[0].length()==2 && ss[1].length()==2 && ss[2].length()==4) {
				boolean f = true;
				for (int j = 0; j < 3; j++) {
					if (ss[j].length()==0) {
						f = false;
					}
				}
				if (f) {
					int dd = Integer.parseInt(ss[0]), mm = Integer.parseInt(ss[1]), yy = Integer.parseInt(ss[2]);
					if (yy >= 2013 && yy <= 2015 && mm >= 1 && mm <= 12) {
						int max = 31;
						if (mm==4 || mm==6 || mm==9 || mm==11)
							max = 30;
						if (mm==2)
							max = 28;
						if (dd > 0 && dd <= max) {
							String m = mm+"";
							if (mm < 10)
								m = "0"+m;
							String d = dd+"";
							if (dd < 10)
								d = "0"+d;
							String q = d+"-"+m+"-"+yy;
							if (!map.containsKey(q))
								map.put(q, 1);
							else
								map.put(q, map.get(q)+1);
						}
					}
				}
			}
		}
		int ans = 0;
		String q = "";
		for (String i : map.keySet()) {
			if (map.get(i) > ans) {
				ans = map.get(i);
				q = i;
			}
		}
		System.out.println(q);
		pw.close();
	}
	private static int nextInt() throws IOException{
		return Integer.parseInt(next());
	}
	
	private static long nextLong() throws IOException{
		return Long.parseLong(next());
	}
	
	private static double nextDouble() throws IOException{
		return Double.parseDouble(next());
	}
	
	private static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
}
//777-444---21-12-2003-12-2003-12-2003--444-777