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

public class MainB {

    public static void main(String[] args) throws Exception {
    	String pattern = "\\d{2}-\\d{2}-\\d{4}";
    	BufferedReader buffer = new BufferedReader(new InputStreamReader(System.in));
    	String line = buffer.readLine();
    	Pattern p = Pattern.compile(pattern);
    	Matcher m = p.matcher(line);
    	TreeMap<String, Integer> map = new TreeMap<String, Integer>();
    	Vector<String> list = new Vector<String>();
    	int index = 0;
    	while(m.find()) {
    		String temp = m.group();
    		line = line.substring(m.end()-8);
    		m = p.matcher(line);
    		int year = Integer.parseInt(temp.substring(6));
    		if(year < 2013 || year > 2015)
    			continue;
    		int month = Integer.parseInt(temp.substring(3, 5));
    		int day = Integer.parseInt(temp.substring(0, 2));
    		if(month == 2)
    			if(day <= 0 || day > 28)
    				continue;
    		if(month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12)
    			if(day <= 0 || day > 31)
    				continue;
    		if(month == 4 || month == 6 || month == 9 || month == 11)
    			if(day <= 0 || day > 30)
    				continue;
    		Calendar c = Calendar.getInstance();
    		c.setLenient(false);
    		try {
    			c.set(year, month, day);
	    		if(map.containsKey(temp)) {
	    			map.put(temp, map.get(temp)+1);
	    		}
	    		else {
	    			list.addElement(temp);
	    			map.put(temp, 1);
	    		}
    		}
    		catch(Exception e) {
    			continue;
    		}
    	}
    	int high = map.get(list.elementAt(0));
    	String ans = list.elementAt(0);
    	for(int i=1; i<list.size(); i++) {
    		if(map.get(list.elementAt(i)) > high) {
    			ans = list.elementAt(i);
    			high = map.get(list.elementAt(i));
    		}
    	}
    	System.out.println(ans);
    }
}
