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
from math import *
#from bisect import *
#from collections import *
#from random import *
#from decimal import *"""
#from heapq import *
#from random import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(3*(10**5))
global flag
def inp():
    return int(input())
def st():
    return input().rstrip('\n')
def lis():
    return list(map(int,input().split()))
def ma():
    return map(int,input().split())
t=1
while(t):
    t-=1
    s=st()
    dd={}
    for i in range(len(s)-9):
        x=s[i:i+10]
        da=x[:2]
        mo=x[3:5]
        fl=0
        ye=x[6:10]
        if(x[2]!='-' or x[5]!='-'):
            continue
        try:
            if(ye in ['2013','2014','2015']):
                fl+=1
            if(int(mo)>=1 and int(mo)<=12):
                fl+=1
            cc=int(mo)
            if(cc in [1,3,5,7,8,10,12]):
                if(int(da)>=1 and int(da)<=31):
                    fl+=1
            elif(cc in [4,6,9,11]):
                if(int(da)>=1 and int(da)<=30):
                    fl+=1
            elif( cc==2):
                if(int(da)>=1 and int(da)<=28):
                    fl+=1
            if(fl==3):
                try:
                    dd[x]+=1
                except:
                    dd[x]=1
                    pass
        except:
            pass
    z=max(dd.values())
    for i in dd.keys():
        if(dd[i]==z):
            print(i)
            break
        
        
                
        
    
    
    
