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


from collections import Counter

x = raw_input()
arr = x.split('-')

for i in range(len(arr)):
	if( arr[i] is ''):
		arr[i] = '0'

outs = []
days = [31,28,31,30,31,30,31,31,30,31,30,31]
for i in range(len(arr)):
	if('2013' in arr[i]  or '2014' in arr[i]  or '2015' in arr[i]):
		if ( i > 1):
			if(int (arr[i-1] ) > 0 and int (arr[i-1] ) < 13 ):
				temp1 = arr[i-2]
				temp2 = temp1[-2:]
				month = int(arr[i-1])-1
				if(int(temp2) > 0 and int(temp2) <= days[month]):				
					temp3 = arr[i][0:4]
					if(temp3 == '2013' or temp3 == '2014' or temp3 == '2015'):
						temp = temp2 + "-" + arr[i-1]+"-" + temp3
						outs.append(temp);

		if ( i <= len(arr)-2):
			temp = arr[i][:-2]
			if(int (arr[i+1] ) > 0 and int (arr[i+1] ) < 13 ):
				month = int(arr[i+1]) - 1
				if(temp > 0 and temp <= days[month]):
					if('2013' in arr[i+2] or '2014' in arr[i+2] or '2015' in arr[i+2]):
						temp3 = arr[i+2][0:4]
						if(temp3 == 2013 or temp3 == 2014 or temp3 == 2015):
							temp = temp + "-" + arr[i+1]+"-" + temp3
							outs.append(temp);

count=0
result=0;

cnt = Counter(outs)
temp =  cnt.most_common(1)
print temp[0][0]
