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>
int YEAR[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int A[32][13][3];
int main(void) {
  char S[100005] = "";
  char* str;
  int l, max = 0, md, mm, my;
  memset(A, 0, 32 * 13 * 3 * sizeof(int));
  scanf("%s", S);
  l = strlen(S);
  str = S;
  while (str < S + l) {
    int m, d, y;
    while (str[0] < '0' && str[1] < '1' && str + 1 < S + l) str++;
    if (str[2] != '-' && str + 2 < S + l) {
      str++;
      continue;
    }
    if (str[3] < '0' || str[4] < '0' || str + 4 >= S + l) {
      str += 4;
      continue;
    }
    m = (str[3] - '0') * 10 + (str[4] - '0');
    if (m == 0 || m > 12) {
      str += 3;
      continue;
    }
    d = (str[0] - '0') * 10 + (str[1] - '0');
    if (d == 0 || d > YEAR[m]) {
      str += 3;
      continue;
    }
    if (str[5] != '-') {
      str += 4;
      continue;
    }
    if (str[6] < '0' || str[7] < '0' || str[8] < '0' || str[9] < '0' ||
        str + 9 >= S + l) {
      str += 3;
      continue;
    }
    y = (str[6] - '0') * 1000 + (str[7] - '0') * 100 + (str[8] - '0') * 10 +
        (str[9] - '0');
    if (y < 2013 || y > 2015) {
      str += 8;
      continue;
    }
    A[d][m][y - 2013]++;
    str += 8;
  }
  for (int i = 0; i < 32; i++) {
    for (int j = 0; j < 13; j++) {
      for (int k = 0; k < 3; k++) {
        int a = A[i][j][k];
        if (a > max) {
          max = a;
          md = i;
          mm = j;
          my = 2013 + k;
        }
      }
    }
  }
  printf("%02d-%02d-%d\n", md, mm, my);
  return 0;
}
