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;
bool valid(string s) {
  int day = (s[0] - '0') * 10 + s[1] - '0';
  int month = (s[3] - '0') * 10 + s[4] - '0';
  int year =
      (s[6] - '0') * 1000 + (s[7] - '0') * 100 + (s[8] - '0') * 10 + s[9] - '0';
  if (year > 2012 && year < 2016) {
    if (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 ||
        month == 10 || month == 12) {
      if (day < 32 && day > 0) {
        return true;
      }
    } else if (month == 2) {
      if (day < 29 && day > 0) {
        return true;
      }
    } else {
      if (month < 13 && day < 31 && day > 0) {
        return true;
      }
    }
  }
  return false;
}
int main() {
  string s;
  cin >> s;
  vector<string> a;
  for (int i = 0; s[i + 9] != '\0'; i++) {
    if (s[i + 2] == '-' && s[i + 5] == '-' && s[i] != '-' && s[i + 1] != '-' &&
        s[i + 3] != '-' && s[i + 4] != '-') {
      string t = string(s.begin() + i, s.begin() + i + 10);
      if (valid(t)) {
        a.push_back(t);
      }
    }
  }
  int ma = 0, ind = -1;
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size(); i++) {
    int t = count(a.begin() + i, a.end(), a[i]);
    if (t >= ma) {
      ma = t;
      ind = i;
    }
    i += t - 1;
  }
  cout << a[ind];
}
