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
def valid(s):
    if(not(s[2]==s[5]=='-')):
        return False
    for i in range(10):
        if(i==2 or i==5):
            continue
        if(s[i]=='-'):
            return False
    m=int(s[6:])
    if(m<2013 or m>2015):
        return False
    m=int(s[3:5])
    if(m<1 or m>12):
        return False
    d=int(s[0:2])
    if(d<1 or d>D[m-1]):
        return False
    return True

D=[31,28,31,30,31,30,31,31,30,31,30,31]


A={}

s=input()
x=s[0:10]
if(valid(x)):
    A[x]=1
for i in range(10,len(s)):
    x=x[1:]+s[i]
    if(valid(x)):
        if(x in A):
            A[x]+=1
        else:
            A[x]=1
maxx=0
ans=""
for item in A:
    if(A[item]>maxx):
        maxx=A[item]
        ans=item
print(ans)
