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[100005];
int cnt[40][20][4];
bool format[10] = {0, 0, 1, 0, 0, 1, 0, 0, 0, 0};
int dayofmonth[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
  scanf("%s", str);
  int n = strlen(str);
  for (int i = 2; i <= n - 8; i++) {
    int st = i - 2;
    bool flag = 0;
    for (int j = 0; j < 10; j++) {
      if ((str[st + j] == '-') != format[j]) {
        flag = 1;
        break;
      }
    }
    if (flag == 1) continue;
    int day = (str[st] - '0') * 10 + (str[st + 1] - '0');
    st += 3;
    int month = (str[st] - '0') * 10 + (str[st + 1] - '0');
    st += 3;
    int year = (str[st] - '0') * 1000 + (str[st + 1] - '0') * 100 +
               (str[st + 2] - '0') * 10 + (str[st + 3] - '0');
    if (year < 2013 || year > 2015 || month < 1 || month > 12 || day < 1 ||
        day > dayofmonth[month])
      continue;
    cnt[day][month][year - 2013]++;
  }
  int maxcnt = 0;
  int d, m, y;
  for (int i = 1; i <= 31; i++) {
    for (int j = 1; j <= 12; j++) {
      for (int k = 0; k < 3; k++) {
        if (maxcnt < cnt[i][j][k]) {
          maxcnt = cnt[i][j][k];
          d = i;
          m = j;
          y = 2013 + k;
        }
      }
    }
  }
  printf("%02d-%02d-%4d", d, m, y);
  return 0;
}
