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.io.*;
import java.util.*;

public class nB {

    Scanner in;
    PrintWriter out;

    class Date implements Comparable<Date> {
        int d;
        int m;
        int y;

        Date(int d, int m, int y) {
            this.d = d;
            this.m = m;
            this.y = y;
        }

        int col;

        @Override
        public int compareTo(Date other) {
            if (this.d == other.d && this.m == other.m && this.y == other.y) {
                return 0;
            } else {
                return 1;
            }
        }
    }

    void solve() {
        String s = in.nextLine();
        int days[] = {
                31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
        };
        TreeSet<Date> set = new TreeSet<Date>();
        for (int i = 0; i < s.length() - 9; i++) {
            String r = s.substring(i, i + 10);
            if ('0' <= r.charAt(0) && r.charAt(0) <= '9' && '0' <= r.charAt(1) && r.charAt(1) <= '9' && '0' <= r.charAt(3) && r.charAt(3) <= '9'
                    && '0' <= r.charAt(4) && r.charAt(4) <= '9' && '0' <= r.charAt(6) && r.charAt(6) <= '9' && '0' <= r.charAt(7) && r.charAt(7) <= '9'
                    && '0' <= r.charAt(8) && r.charAt(8) <= '9' && '0' <= r.charAt(9) && r.charAt(9) <= '9') {
                int d = Integer.parseInt(r.substring(0, 2));
                int m = Integer.parseInt(r.substring(3, 5));
                int y = Integer.parseInt(r.substring(6));
                if (r.charAt(2) == '-' && r.charAt(5) == '-' && 1 <= m && m <= 12 && 2013 <= y && y <= 2015 && 1 <= d && d <= days[m - 1]) {
                    Date curDate = new Date(d, m, y);
                    boolean find = false;
                    for (Date x : set) {
                        if (x.compareTo(curDate) == 0) {
                            x.col++;
                            find = true;
                        }
                    }
                    if (!find) {
                        curDate.col = 1;
                        set.add(curDate);
                    }
                }
            }
        }
        int max = set.first().col;
        Date maxx = set.first();
        for (Date x : set) {
            if (x.col >= max) {
                max = x.col;
                maxx = x;
            }
        }
        int ansd = maxx.d;
        int ansm = maxx.m;
        int ansy = maxx.y;
        if (0 <= ansd && ansd <= 9) {
            out.print("0");
            out.print(ansd);
        }else{
            out.print(ansd);
        }
        out.print("-");
        if (0 <= ansm && ansm <= 9) {
            out.print("0");
            out.print(ansm);
        }else{
            out.print(ansm);
        }
        out.print("-");
        out.print(ansy);
    }

    void run() {
        in = new Scanner(System.in);
        out = new PrintWriter(System.out);
        try {
            solve();
        } finally {
            out.close();
        }
    }

    public static void main(String[] args) {
        new nB().run();
    }
}
