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[100010];
int times[40][15][5];
int monthmaxdays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool isdigt[11] = {1, 1, 0, 1, 1, 0, 1, 1, 1, 1};
void print(int dd, int mm, int yyyy) {
  if (dd < 10)
    printf("0%d-", dd);
  else
    printf("%d-", dd);
  if (mm < 10)
    printf("0%d-", mm);
  else
    printf("%d-", mm);
  printf("%d\n", yyyy + 2013);
}
int main() {
  while (scanf("%s", str) == 1) {
    memset(times, 0, sizeof(times));
    int len = strlen(str);
    for (int i = 0; i + 9 < len; i++) {
      bool bl = true;
      for (int j = 0; j <= 9; j++)
        if ((isdigit(str[i + j])) != isdigt[j]) {
          bl = false;
          break;
        }
      if (!bl) continue;
      int dd = (str[i] - '0') * 10 + str[i + 1] - '0',
          mm = (str[i + 3] - '0') * 10 + str[i + 4] - '0',
          yyyy = (str[i + 6] - '0') * 1000 + (str[i + 7] - '0') * 100 +
                 (str[i + 8] - '0') * 10 + str[i + 9] - '0';
      if (mm < 1 || mm > 12 || yyyy < 2013 || yyyy > 2015 || dd < 1 ||
          dd > monthmaxdays[mm])
        continue;
      times[dd][mm][yyyy - 2013]++;
    }
    int dd = 1, mm = 1, yyyy = 0;
    for (int y = 0; y <= 2; y++)
      for (int m = 1; m <= 12; m++)
        for (int d = 1; d <= monthmaxdays[m]; d++) {
          if (times[d][m][y] > times[dd][mm][yyyy]) dd = d, mm = m, yyyy = y;
        }
    print(dd, mm, yyyy);
  }
}
