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;
const int dayinmonth[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int num(string s) {
  int res = 0;
  for (int i = 0, _a = (int(s.size())); i < _a; ++i)
    if (s[i] < '0' || s[i] > '9')
      return -1;
    else
      res = res * 10 + s[i] - '0';
  return res;
}
bool correct(string s) {
  if (s[2] != '-' || s[5] != '-') return 0;
  int day = num(s.substr(0, 2));
  int month = num(s.substr(3, 2));
  int year = num(s.substr(6, 4));
  if (day == -1 || month == -1 || year == -1 || year < 2013 || year > 2015 ||
      month < 1 || month > 12 || day < 1 || day > dayinmonth[month])
    return 0;
  return 1;
}
map<string, int> mm;
char s[100007];
int n;
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  string st;
  for (int i = 1, _c = n - 9; i <= _c; i++) {
    st = string(s + i, s + i + 10);
    if (correct(st)) mm[st]++;
  }
  string res;
  int best = 0;
  for (map<string, int>::iterator it = mm.begin(); it != mm.end(); it++)
    if (best < it->second) {
      best = it->second;
      res = it->first;
    }
  cout << res << endl;
  return 0;
}
