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 main() {
  char a[1000000];
  cin >> a;
  int l = strlen(a);
  int i, j;
  int month;
  int year;
  int date;
  int found[10000][4] = {0};
  int founi = 0;
  int flag;
  int ac[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  for (i = 2; i < l - 7; i++) {
    if (a[i - 2] != '-' && a[i - 1] != '-' && a[i + 0] == '-' &&
        a[i + 1] != '-' && a[i + 2] != '-' && a[i + 3] == '-' &&
        a[i + 4] != '-' && a[i + 5] != '-' && a[i + 6] != '-' &&
        a[i + 7] != '-') {
      month = (a[i + 1] - '0') * 10 + (a[i + 2] - '0');
      date = (a[i - 2] - '0') * 10 + (a[i - 1] - '0');
      year = (a[i + 4] - '0') * 1000 + (a[i + 5] - '0') * 100 +
             (a[i + 6] - '0') * 10 + (a[i + 7] - '0');
      if (month <= 12 && month >= 1 && year <= 2015 && year >= 2013) {
        if (date <= ac[month] && date >= 1) {
          flag = 0;
          for (j = 0; j < founi; j++) {
            if (found[j][0] == year && found[j][1] == month &&
                found[j][2] == date) {
              flag = 1;
              found[j][3]++;
            }
          }
          if (flag == 0) {
            found[founi][0] = year;
            found[founi][1] = month;
            found[founi][2] = date;
            found[founi][3] = 1;
            founi++;
          }
        }
      }
    }
  }
  int max = -1;
  max = -1;
  for (i = 0; i < founi; i++) {
    if (max < found[i][3]) {
      max = found[i][3];
      year = found[i][0];
      month = found[i][1];
      date = found[i][2];
    }
  }
  if (date < 10) {
    cout << "0" << date;
  } else {
    cout << date;
  }
  cout << '-';
  if (month < 10) {
    cout << "0" << month;
  } else {
    cout << month;
  }
  cout << "-";
  cout << year << endl;
  return 0;
}
