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
import java.util.Scanner;
public class Main {
    public static void main( String[] strings ) {
        Scanner in = new Scanner( System.in );
        String str = in.next();
        int i, j;
        int[] cnt = new int[1200];
        for ( i = 0; i < 1200; ++i ) {
            cnt[i] = 0;
        }
        int base, d, m;
        int[] month = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        int k;
        for ( k = 2013; k <= 2015; ++k ) {
            String year = String.valueOf(k);
            base = 400 * ( k - 2013 );
            for ( i = 0; i < str.length();  ) {
                j = str.indexOf(year, i);
                if ( j < 0 ) {
                    break;
                }
                i = j + 1;
                if ( j < 6 ) {
                    continue;
                }
                try {
                    d = Integer.parseInt(str.substring(j-6, j-4));
                    m = Integer.parseInt(str.substring(j-3, j-1));
                    if ( (m < 1) || (m > 12) || (d < 1) || (d > month[m-1])
                           || (str.charAt(j-4) != '-') || (str.charAt(j-1) != '-')) {
                        continue;
                    }
                }
                catch(NumberFormatException exc) {
                    continue;
                }
                ++cnt[d + (m-1)*32 + base];
            }
        }
        for ( j = 0, i = 1; i < 1200; ++i ) {
            if ( cnt[i] > cnt[j] ) {
                j = i;
            }
        }
        int r = j % 400;
        System.out.printf("%02d-%02d-%4d\r\n", r%32, r/32 + 1, j/400 + 2013);
    }
}
