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.*;

public class BAncientProphecy {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String string = new String();
        String ans = new String();
        string = sc.next();
        int n = string.length();
        char[] ch = new char[n];
        int temp;
        HashSet<String> set = new HashSet<String>();
        HashMap<String, Integer> map = new HashMap<String, Integer>();
        ch = string.toCharArray();
        n -= 9;
        for (int i = 0; i < n; i++) {
            if (ch[i + 2] != '-' || ch[i + 5] != '-')
                continue;
            if (ch[i] == '-' || ch[i] > '3')
                continue;
            if (ch[i + 3] == '-' || ch[i + 3] > '1')
                continue;
            if (ch[i + 6] != '2' || ch[i + 7] != '0' || ch[i + 8] != '1')
                continue;
            if (ch[i + 9] == '-' || ch[i + 9] > '5' || ch[i + 9] < '3')
                continue;
            if (ch[i + 1] == '-' || ch[i + 4] == '-')
                continue;
            if (ch[i + 4] == '2' && ch[i] == '2' && ch[i + 1] > '8')
                continue;
            if (ch[i + 4] == '2' && ch[i + 3] == '0' && ch[i] > '2')
                continue;
            if (ch[i + 3] == '0' && ch[i + 4] == '0')
                continue;
            if (ch[i] == '0' && ch[i + 1] == '0')
                continue;
            if (ch[i + 3] == '1' && ch[i + 4] > '2')
                continue;
            if (ch[i] == '3' && ch[i + 1] > '1')
                continue;
            if (ch[i] == '3'
                    && ch[i] != '0'
                    && (ch[i + 4] == '4' || ch[i + 4] == '6'
                            || ch[i + 4] == '9' || (ch[i + 4] == '1' && ch[i + 3] == '1')))
                continue;
            StringBuilder sb = new StringBuilder();
            sb.append("" + ch[i] + ch[i + 1] + '-' + ch[i + 3] + ch[i + 4]
                    + '-' + '2' + '0' + '1' + ch[i + 9]);
            string = sb.toString();
            if (map.containsKey(string)) {
                temp = map.get(string);
                temp++;
                map.put(string, temp);
            } else {
                temp = 1;
                map.put(string, temp);
                set.add(string);
            }
        }
        n = 0;
        Iterator<String> it = set.iterator();
        while (it.hasNext()) {
            string = it.next();
            temp = map.get(string);
            if (temp > n) {
                n = temp;
                ans = string;
            }
        }
        System.out.print(ans);
    }
}
