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;
vector<int> day, month, year;
map<pair<int, pair<int, int> >, int> mp;
int main() {
  string s;
  cin >> s;
  int da[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '-') {
      if (i < 2) continue;
      if (s.length() - i <= 7) continue;
      if (s[i + 3] != '-') continue;
      if (s[i - 2] == '-' || s[i - 1] == '-' || s[i + 1] == '-' ||
          s[i + 2] == '-' || s[i + 4] == '-' || s[i + 5] == '-' ||
          s[i + 6] == '-' || s[i + 7] == '-')
        continue;
      int d = 10 * (s[i - 2] - '0') + (s[i - 1] - '0');
      int m = 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
      int y = 1000 * (s[i + 4] - '0') + 100 * (s[i + 5] - '0') +
              10 * (s[i + 6] - '0') + (s[i + 7] - '0');
      day.push_back(d);
      month.push_back(m);
      year.push_back(y);
    }
  }
  for (int i = 0; i < day.size(); i++) {
    if (month[i] >= 1 && month[i] <= 12 && da[month[i]] >= day[i] &&
        day[i] > 0 && year[i] > 2012 && year[i] < 2016)
      mp[make_pair(day[i], make_pair(month[i], year[i]))]++;
  }
  map<pair<int, pair<int, int> >, int>::iterator it;
  int ans = 0;
  int d, m, y;
  for (it = mp.begin(); it != mp.end(); ++it) {
    if ((*it).second > ans) {
      d = (*it).first.first;
      m = (*it).first.second.first;
      y = (*it).first.second.second;
      ans = (*it).second;
    }
  }
  if (d < 10) cout << "0";
  cout << d << "-";
  if (m < 10) cout << "0";
  cout << m << "-";
  cout << y;
  return 0;
}
