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() {
  int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  string input;
  map<string, int> cont;
  int maxmentioned = 0;
  string ans;
  cin >> input;
  int len = input.size();
  for (int i = 2; i < len; ++i) {
    if (i + 7 < len && input[i] == '-' && input[i + 3] == '-') {
      if (input[i - 1] == '-' || input[i - 2] == '-' || input[i + 1] == '-' ||
          input[i + 2] == '-' || input[i + 4] == '-' || input[i + 5] == '-' ||
          input[i + 6] == '-' || input[i + 7] == '-')
        continue;
      int day = (input[i - 2] - '0') * 10 + (input[i - 1] - '0');
      int month = (input[i + 1] - '0') * 10 + (input[i + 2] - '0');
      int year = (input[i + 4] - '0') * 1000 + (input[i + 5] - '0') * 100 +
                 (input[i + 6] - '0') * 10 + (input[i + 7] - '0');
      if (year < 2013 || year > 2015) continue;
      if (month < 1 || month > 12) continue;
      if (day < 1 || day > months[month]) continue;
      char strdate[15];
      sprintf(strdate, "%02d-%02d-%d", day, month, year);
      ++cont[string(strdate)];
      if (cont[string(strdate)] > maxmentioned) {
        maxmentioned = cont[string(strdate)];
        ans = string(strdate);
      }
    }
  }
  cout << ans;
  return 0;
}
