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() {
  string s;
  cin >> s;
  vector<string> A;
  for (int I = 0; I < s.length() - 9; I += 1) {
    string sub = s.substr(I, 10);
    bool ValidDM = false;
    int Day = 0;
    if (sub[0] == '0') {
      Day = sub[1] - '0';
    } else
      Day = (sub[0] - '0') * 10 + (sub[1] - '0');
    int Mon = 0;
    if (sub[3] == '0') {
      Mon = sub[4] - '0';
    } else
      Mon = (sub[3] - '0') * 10 + (sub[4] - '0');
    if (sub[0] >= '0' && sub[0] <= '9' && sub[1] >= '0' && sub[1] <= '9' &&
        sub[3] >= '0' && sub[3] <= '9' && sub[4] >= '0' && sub[4] <= '9') {
      if (Mon == 1)
        if (Day <= 31) ValidDM = true;
      if (Mon == 2)
        if (Day <= 28) ValidDM = true;
      if (Mon == 3)
        if (Day <= 31) ValidDM = true;
      if (Mon == 4)
        if (Day <= 30) ValidDM = true;
      if (Mon == 5)
        if (Day <= 31) ValidDM = true;
      if (Mon == 6)
        if (Day <= 30) ValidDM = true;
      if (Mon == 7)
        if (Day <= 31) ValidDM = true;
      if (Mon == 8)
        if (Day <= 31) ValidDM = true;
      if (Mon == 9)
        if (Day <= 30) ValidDM = true;
      if (Mon == 10)
        if (Day <= 31) ValidDM = true;
      if (Mon == 11)
        if (Day <= 30) ValidDM = true;
      if (Mon == 12)
        if (Day <= 31) ValidDM = true;
    } else
      continue;
    if (Day == 0) continue;
    bool ValidY = false;
    if (sub[6] == '2' && sub[7] == '0' && sub[8] == '1' &&
        (sub[9] == '3' || sub[9] == '4' || sub[9] == '5'))
      ValidY = true;
    bool ValidOther = false;
    if (sub[2] == '-' && sub[5] == '-') ValidOther = true;
    if (ValidOther && ValidY && ValidDM) {
      A.push_back(sub);
      continue;
    }
  }
  int maxT = 0;
  int res;
  for (int I = 0; I < A.size(); I += 1) {
    int occ = 0;
    for (int T = 0; T < A.size(); T += 1) {
      if (A[I] == A[T]) occ += 1;
    }
    if (occ > maxT) {
      maxT = occ;
      res = I;
    }
  }
  cout << A[res];
}
