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>
using namespace std;
char s[100005];
char tmp[11];
int yy, dd, mm;
int _map[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int num;
char result[100005][11];
int resultnum[100005];
int check_dd_mm() {
  if (_map[mm] >= dd) return 1;
  return 0;
}
int add(int point) {
  for (int i = 9; i >= 0; i--) tmp[i] = s[point + i - 9];
  tmp[10] = '\0';
  for (int i = 1; i <= num; i++)
    if (!strcmp(tmp, result[i])) {
      resultnum[i]++;
      return 0;
    }
  num++;
  resultnum[num] = 1;
  strcpy(result[num], tmp);
  return 0;
}
int check(int i) {
  int flag = 1;
  if (!(s[i] == '3' || s[i] == '4' || s[i] == '5')) flag = 0;
  if (!(s[i - 1] == '1' && s[i - 2] == '0' && s[i - 3] == '2' &&
        s[i - 4] == '-' && s[i - 7] == '-')) {
    flag = 0;
  }
  if (!(s[i - 5] >= '0' && s[i - 5] <= '9')) flag = 0;
  if (!(s[i - 6] >= '0' && s[i - 6] <= '9')) flag = 0;
  if (!(s[i - 8] >= '0' && s[i - 8] <= '9')) flag = 0;
  if (!(s[i - 9] >= '0' && s[i - 9] <= '9')) flag = 0;
  yy = (s[i] - '0') + 2010;
  mm = (s[i - 6] - '0') * 10 + (s[i - 5] - '0');
  if (mm <= 0 || mm >= 13) flag = 0;
  dd = (s[i - 9] - '0') * 10 + (s[i - 8] - '0');
  if (dd <= 0) flag = 0;
  if (!flag) return 0;
  if (!check_dd_mm()) return 0;
  return 1;
}
int main() {
  while (gets(s)) {
    num = 0;
    memset(resultnum, 0, sizeof(resultnum));
    int len = strlen(s);
    for (int i = 9; i < len; i++) {
      if (check(i)) {
        add(i);
      }
    }
    int _maxnum = -1;
    int _maxpoint;
    for (int i = 1; i <= num; i++) {
      if (_maxnum < resultnum[i]) {
        _maxnum = resultnum[i];
        _maxpoint = i;
      }
    }
    printf("%s\n", result[_maxpoint]);
  }
  return 0;
}
