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
mm = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

def dig(s, q, l):
    for i in range(l):
        if not s[q+i].isdigit():
            return -1
    return int(s[q:q+l])

def dat(s, q):
    d = dig(s, q, 2)
    m = dig(s, q + 3, 2)
    y = dig(s, q + 6, 4)
#    print d,m,y,s[q:q+10]
    if d < 1 or m < 1 or m > 12 or d > mm[m - 1] or \
       y < 2013 or y > 2015 or s[q+2] != '-' or s[q+5] != '-':
        return None
    return s[q:q+10]

def main():
    input = raw_input()
    m = {}
    for i in range(len(input) - 9):
        td = dat(input, i)
        if td is not None:
            if not m.has_key(td):
                m[td] = 0
            m[td] += 1
    ans = ''
    l = -1
    for i in m.keys():
        if m[i] > l:
            ans = i
            l = m[i]
    print ans


main()