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
d = {"01":"31","02":"28","03":"31","04":"30","05":"31","06":"30","07":"31","08":"31","09":"30","10":"31","11":"30","12":"31"}
y = {"2013":1,"2014":1,"2015":1}
d2 = {}

def is_valid(t):
	if len(t) != 10:
		return False
	if t[2] != '-' or t[5] != '-':
		return False
	if t[3:5] not in d:
		return False
	if '-' in t[0:2]:
		return False
	if int(t[0:2]) == 0:
		return 0
	if int(t[0:2]) > int(d[t[3:5]]):
		return False
	tt = t[6:10]
	if tt not in y:
		return False
	return True

s = raw_input()
l = len(s)
i = 0
while i+9 < l:
	tmp = s[i:i+10]
	if is_valid(tmp):
		if tmp in d2:
			d2[tmp] += 1
		else:
			d2[tmp] = 1
	i += 1
mx = 0
res = ""
for key in d2:
	if d2[key] > mx:
		mx = d2[key]
		res = key
print res
