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;
int dp[35][15][5];
int month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
char s[100005];
int main() {
  int d, m, y;
  int ad, am, ay, mx = 0;
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i + 9 < len; i++) {
    if (s[i + 2] != '-' || s[i + 5] != '-') continue;
    if (s[i + 6] != '2' || s[i + 7] != '0' || s[i + 8] != '1') continue;
    bool flag = true;
    for (int j = 0; j <= 9; j++) {
      if (j == 2 || j == 5) continue;
      if (s[i + j] < '0' || s[i + j] > '9') {
        flag = false;
        break;
      }
    }
    if (flag == false) continue;
    d = (s[i] - '0') * 10 + s[i + 1] - '0';
    m = (s[i + 3] - '0') * 10 + s[i + 4] - '0';
    if (m < 1 || m > 12 || d < 1 || d > month[m]) continue;
    y = s[i + 9] - '0';
    if (y < 3 || y > 5) continue;
    dp[d][m][y]++;
    if (dp[d][m][y] > mx) {
      mx = dp[d][m][y];
      ad = d, am = m, ay = y;
    }
  }
  printf("%02d-%02d-201%d\n", ad, am, ay);
  return 0;
}
