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 re
stri = raw_input ()
tveebi = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

def MAX(L, year):
    Lnew=[]
    for line in L:
        a,b,c = line.split ("-")
        a, b = int(a), int(b)

        if (a>0 and b>0 and b<=12 and a<=tveebi[b]):
            Lnew.append((a,b))
    Lnew.sort()
    if (len(Lnew)==0):
        return -1,-1

    MAX = 1
    counter=1
    ans=str(Lnew[0][0]).zfill(2)+"-"+str(Lnew[0][1]).zfill(2)+"-"+c

    aa, bb = Lnew[0]
    for i in range(1, len(Lnew)):
        if (Lnew[i][0] == aa and Lnew[i][1] == bb):
            counter+=1
            if (counter>MAX):
                ans = str(Lnew[i][0]).zfill(2)+"-"+str(Lnew[i][1]).zfill(2)+"-"+c
                MAX = counter
        else:
            counter=1
        aa, bb = Lnew[i][0], Lnew[i][1]
    #print ans, MAX
    return ans, MAX
        
            
        


_13 = []
_14 = []
_15 = []


def f(year):
    year=str(year)
    ans = re.search(r"[0-9][0-9]-[0-9][0-9]-"+year, stri)
    old = 0
    ansLIST=[]
    while ans!=None:
        ansLIST.append(stri[old+ans.span()[0]:old+ans.span()[1]])
        old += ans.span()[0]+1
        ans = re.search(r"[0-9][0-9]-[0-9][0-9]-"+year, stri[old:])
    #print ansLIST
    return ansLIST


_13 = f (2013)
_14 = f (2014)
_15 = f (2015)
    

_13_ans, _13_ = MAX(_13, 13)
_14_ans, _14_ = MAX(_14, 14)
_15_ans, _15_ = MAX(_15, 15)


if (_13_>_14_ and _13_>_15_):
    print _13_ans
if (_14_>_13_ and _14_>_15_):
    print _14_ans
if (_15_>_14_ and _15_>_13_):
    print _15_ans

