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 ji[4][15][35];
int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline bool judge(int day, int month, int year) {
  if ((year >= 2013 && year <= 2015) == 0) return false;
  if ((month >= 1 && month <= 12) == 0) return false;
  if ((day > 0 && day <= mon[month]) == 0) return false;
  return true;
}
inline void solve(string s) {
  int i = 0, day, month, year;
  day = month = year = 0;
  while (s[i] != '-' && i != s.size()) {
    day = day * 10 + s[i] - '0';
    i++;
  }
  if (i != 2) return;
  i++;
  while (s[i] != '-' && i != s.size()) {
    month = month * 10 + s[i] - '0';
    i++;
  }
  if (i != 5) return;
  i++;
  while (s[i] != '-' && i != s.size()) {
    year = year * 10 + s[i] - '0';
    i++;
  }
  if (i != 10) return;
  if (!judge(day, month, year)) return;
  ji[year - 2013][month][day]++;
}
string s;
int main() {
  getline(cin, s);
  for (int i = 0; i < s.size() - 9; i++) {
    string t = s.substr(i, 10);
    solve(t);
  }
  int day, month, year, pnt = 0;
  day = month = year = 0;
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < 15; j++) {
      for (int k = 0; k < 35; k++) {
        if (pnt < ji[i][j][k]) {
          year = i + 2013;
          month = j;
          day = k;
          pnt = ji[i][j][k];
        }
      }
    }
  }
  if (day < 10) cout << 0;
  printf("%d-", day);
  if (month < 10) cout << 0;
  printf("%d-%d\n", month, year);
  return 0;
}
