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.math.*;


public class Main {
   
    static BufferedReader in; 
    
    public static void main(String[] args) throws IOException{        
        File file = new File("input.txt");
        if( file.exists() ) in = new BufferedReader(new FileReader(file));
        else in = new BufferedReader(new InputStreamReader(System.in));
        
        int months[]={0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        String s=in.readLine(), cur, ans;
        HashMap<String, Integer> map=new HashMap<>();
        int day, month, year, times=0;
        String toks[];
        for(int i=0; i<=s.length()-10; i++){
            cur=s.substring(i, i+10);
            if( !cur.matches("[0-9][0-9]-[0-9][0-9]-[0-9][0-9][0-9][0-9]") )
                continue;
            toks=cur.split("-");
            day=Integer.parseInt(toks[0]);
            month=Integer.parseInt(toks[1]);
            year=Integer.parseInt(toks[2]);
            if(year<2013 || year>2015 || month<1 || month>12 || day<1 || day>months[month])
                continue;
            if( map.containsKey(cur) ) map.put(cur, map.get(cur)+1);
            else map.put(cur, 1);            
        }
        ans="";
        for (String str : map.keySet()) {
            if(map.get(str)>times) {
                times=map.get(str);
                ans=str;
            }
        }
        System.out.println(ans);
    }
    
    static void out(Object ...o){ System.out.println(Arrays.deepToString(o)); }    
    
    static String[] readToks() throws IOException{
        return in.readLine().split("[ ]+");
    }
    
    static int readInt() throws IOException{
        return Integer.parseInt(in.readLine());
    }
    
    static long readLong() throws IOException{
        return Long.parseLong(in.readLine());
    }
       
    static int[] readNums(int n) throws IOException{
        int[] nums = new int[n];
	int idx = 0;
	String line = in.readLine().trim();
	for(int i = 0; i < line.length(); i++) {
            char c = line.charAt(i);
		if(c == ' ') idx++;
		else {
                    int d = c - '0';
                    nums[idx] = 10 * nums[idx] + d;
		}
	}
		
	return nums;
    }
	
    static int[] readNums() throws IOException {		
        int idx = 0, n = 0;		
        String line = in.readLine().trim();
	int i;
	for(i = 0; i < line.length(); i++) {
            char c = line.charAt(i);
            if(c == ' ') break;
            int d = c - '0';
            n = 10 * n + d;
        }
		
	int[] nums = new int[n];
	for(i = i + 1; i < line.length(); i++) {
            char c = line.charAt(i);
            if(c == ' ') idx++;
            else {
                int d = c - '0';
                nums[idx] = 10 * nums[idx] + d;
            }
        }
	return nums;
    }
}