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
#include <bits/stdc++.h>
char str[100001];
int cou[32][13][2020];
int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool isnum(char c) {
  if (c >= '0' && c <= '9') return true;
  return false;
}
bool isleap(int year) {
  if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) return true;
  return false;
}
int main() {
  while (scanf("%s", str) != EOF) {
    memset(cou, 0, sizeof(cou));
    int month, year, day, dcount = 0;
    month = 0, year = 0, day = 0;
    int len = strlen(str), ans = 0, y = 0, m = 0, d = 0;
    for (int i = 0; i < len; i++) {
      if (isnum(str[i]) && (i + 9) < len) {
        if (isnum(str[i + 1]) && !isnum(str[i + 2]) && isnum(str[i + 3]) &&
            isnum(str[i + 4]) && !isnum(str[i + 5]) && isnum(str[i + 6]) &&
            isnum(str[i + 7]) && isnum(str[i + 8]) && isnum(str[i + 9])) {
          day = (str[i] - '0') * 10 + str[i + 1] - '0';
          if (day > 31 || day == 0) continue;
          month = (str[i + 3] - '0') * 10 + str[i + 4] - '0';
          if (month > 12) continue;
          year = (str[i + 6] - '0') * 1000 + (str[i + 7] - '0') * 100 +
                 (str[i + 8] - '0') * 10 + str[i + 9] - '0';
          if (year < 2013 || year > 2015) continue;
          if (day > months[month]) continue;
          cou[day][month][year]++;
          if (ans < cou[day][month][year]) {
            d = day;
            m = month;
            y = year;
            ans = cou[day][month][year];
          }
        }
      }
    }
    printf("%02d-%02d-%d\n", d, m, y);
  }
  return 0;
}
