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

days = [31,28,31,30,31,30,31,31,30,31,30,31]
d = []
for i in range(1,32):
   if i<10:
    d.append('0'+str(i))
   else:
       d.append(str(i))
mon = []
hash_mo = {}
for i in range(1,13):
    hash_mo[i] = days[i-1]
for i in range(1,13):
    if i<10:
        mon.append('0'+str(i))
    else:
        mon.append(str(i))
# print(mon)
lis = ['2013','2014','2015']
k = input()
posn = []

for i in range(1,len(k)):
    if k[i] == '-' :
        posn.append(i)
# print(posn)
hash = {}
for i in range(len(posn)-1):
  if posn[i+1] - posn[i] == 3:
   m = posn[i]
   if 0<=m-2<=len(k)-1 and 0<=m-1<=len(k)-1 and 0<=m<=len(k)-1 and 0<=m+2<=len(k)-1 and 0<=m+3<=len(k)-1 and 0<=m+4<=len(k)-1:
     if k[m+4:m+8] in lis:
     #  print(k[posn[m+1]+1:4])
      day = k[m-2] + k[m-1]

      month = k[m+1] + k[m+2]
      # print(day,month)
      if month in mon and day in d:
       if int(day)<=hash_mo[int(month)]:
        s = k[m-2] + k[m-1] + k[m] + k[m+1] + k[m+2] + k[m+3] + k[m+4:m+8]

        try:
          hash[s]
        except:
          hash[s] = 1
        else:
          hash[s]+=1
max = 0

for i in hash.keys():
    if hash[i]>max:
        max = hash[i]
        yo  = i
print(yo)
