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.IOException;
import java.io.InputStreamReader;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeMap;


public class B {
	
	static class Scanner{
		BufferedReader br=null;
		StringTokenizer tk=null;
		public Scanner(){
			br=new BufferedReader(new InputStreamReader(System.in));
		}
		public String next() throws IOException{
			while(tk==null || !tk.hasMoreTokens())
				tk=new StringTokenizer(br.readLine());
			return tk.nextToken();
		}
		public int nextInt() throws NumberFormatException, IOException{
			return Integer.valueOf(next());
		}
		public double nextDouble() throws NumberFormatException, IOException{
			return Double.valueOf(next());
		}
	}
	
	static boolean isdigit(char a){
		return (a>='0' && a<='9');
	}
	
	
	
	static int getnumber(int from,int to,char[] s){
		int ret=0;
		for(int i=from;i<to;i++){
			ret*=10;
			ret+=s[i] - '0';
		}
		return ret;
	}
	
	static boolean isadate(char[] s,int index){
		if (index+9>=s.length)
			return false;
		boolean d=isdigit(s[index]) && isdigit(s[index+1]) && s[index+2]=='-';
		boolean m=isdigit(s[index+3]) && isdigit(s[index+4]) && s[index+5]=='-';
		boolean y=isdigit(s[index+6]) && isdigit(s[index+7]) && isdigit(s[index+8]) && isdigit(s[index+9]);
		return d && m && y;
	}
	
	static int[] meses={31,28,31,30,31,30,31,31,30,31,30,31};
	
	static boolean validdate(char[] s,int index){
		int d=getnumber(index,index+2,s);
		int m=getnumber(index+3,index+5,s);
		int y=getnumber(index+6, index+10,s);
		if (!(y>=2013 && y<=2015))
			return false;
		if (!(m>=1 && m<=12))
			return false;
		int diasmes=meses[m-1];
		if (!(d>=1 && d<=diasmes))
			return false;
		return true;
	}
	
	
	public static void main(String args[]) throws NumberFormatException, IOException{
		Scanner sc=new Scanner();
		char[] string=sc.next().toCharArray();
		TreeMap<String,Integer> tm=new TreeMap<String,Integer>();
		for(int i=0;i<string.length;i++){
			if (isadate(string,i)==false)
				continue;
			if (validdate(string,i)==false)
				continue;
			StringBuilder sb=new StringBuilder();
			for(int j=0;j<10;j++)
				sb.append(string[i+j]+"");
			String tmp=sb.toString();
			if (tm.containsKey(tmp))
				tm.put(tmp, tm.get(tmp)+1);
			else
				tm.put(tmp, 1);
		}
		String ans="";
		int MAX=0;
		Set<String> t=tm.keySet();
		for(String actual: t){
			int val=tm.get(actual);
			if (val>MAX){
				MAX=val;
				ans=actual;
			}
		}
		System.out.println(ans);
	}

}
