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
s=input().rstrip()
ans=[]
p=dict()
p[1]=p[3]=p[5]=p[7]=p[8]=p[10]=p[12]=31

p[4]=p[6]=p[9]=p[11]=30
p[2]=28
for i in range(len(s)-3):
    
    if s[i:i+4]=='2013' or s[i:i+4]=='2014' or s[i:i+4]=='2015':
        #print('halua')
        if s[i-1]=='-' and s[i-2]!='-' and s[i-3]!='-' and s[i-4]=='-' and s[i-5]!='-' and  s[i-6]!='-':
            #print('hand',int(s[i-3] + s[i-2]))
            if int(s[i-3]+s[i-2])>=1 and int(s[i-3]+s[i-2])<=12:
                #print('bhadu')
                if int(s[i-6]+s[i-5])<=p[int(s[i-3]+s[i-2])] and int(s[i-6]+s[i-5])>=1:
                    ans.append(s[i-6:i+4])
#print(ans)
p=dict()
for i in ans:
    if i in p:
        p[i]+=1
    else:
        p[i]=1
mini=0
ans=''
for i in p:
    if p[i]>mini:
        mini=p[i]
        ans=i
print(ans)
        
        
        
