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
a=input()
n=len(a)
z=[31,28,31,30,31,30,31,31,30,31,30,31]
e=[[[0 for k in range(z[j])] for j in range(12)] for i in range(3)]
for i in range(n-9):
    if a[i+2]==a[i+5]=='-' and str(a[i]+a[i+1]).isdigit() and str(a[i+3]+a[i+4]).isdigit() and str(a[i+6]+a[i+7]+a[i+8]+a[i+9]).isdigit():
        b,c,d=int(a[i]+a[i+1]),int(a[i+3]+a[i+4]),int(a[i+6]+a[i+7]+a[i+8]+a[i+9])
        if 2013<=d<=2015 and 1<=c<=12 and 1<=b<=z[c-1]:
            e[d-2013][c-1][b-1]+=1
i=j=k=0
for i1 in range(3):
    for j1 in range(12):
        for k1 in range(z[j1]):
            if e[i1][j1][k1]>e[i][j][k]:
                i,j,k=i1,j1,k1
i,j,k=str(i+2013),str(j+1),str(k+1)
print('0'*(2-len(k))+k,'0'*(2-len(j))+j,i,sep='-')