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 correct(int day, int month) {
  if (day == 0 || month == 0) return false;
  if (month == 2 && day <= 28)
    return true;
  else if ((month == 4 || month == 6 || month == 9 || month == 11) && day <= 30)
    return true;
  else if (day <= 31 && (month == 1 || month == 3 || month == 5 || month == 7 ||
                         month == 8 || month == 10 || month == 12))
    return true;
  return false;
}
int main() {
  stringstream ss;
  vector<string> v;
  map<string, int> mp;
  string s, t, month, day, res;
  cin >> s;
  int x, y;
  for (int i = s.size() - 1; i >= 9; i--) {
    t.push_back(s[i - 3]);
    t.push_back(s[i - 2]);
    t.push_back(s[i - 1]);
    t.push_back(s[i]);
    if (t == "2013" || t == "2015" || t == "2014") {
      if (s[i - 4] == '-' && s[i - 7] == '-' && isdigit(s[i - 6]) &&
          isdigit(s[i - 5]) && isdigit(s[i - 9]) && isdigit(s[i - 8])) {
        month.push_back(s[i - 6]);
        month.push_back(s[i - 5]);
        day.push_back(s[i - 9]);
        day.push_back(s[i - 8]);
        ss << month;
        ss >> x;
        ss.clear();
        ss << day;
        ss >> y;
        ss.clear();
        if (correct(y, x)) {
          res = day + "-" + month + "-" + t;
          v.push_back(res);
          mp[res]++;
        }
        month = "";
        day = "";
      }
    }
    t = "";
  }
  res = v[0];
  for (int i = 1; i < v.size(); i++) {
    if (mp[v[i]] > mp[res]) res = v[i];
  }
  cout << res;
}
