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 mon[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
map<string, int> mp;
vector<pair<int, string> > vis;
int isCorrect(string s) {
  int year, month, day;
  if (s[0] == '-' || s[1] == '-' || s[3] == '-' || s[4] == '-' || s[6] == '-' ||
      s[7] == '-' || s[8] == '-' || s[9] == '-')
    return 0;
  if (s[2] != '-' || s[5] != '-') return 0;
  day = (s[0] - '0') * 10 + s[1] - '0';
  month = (s[3] - '0') * 10 + s[4] - '0';
  year = 0;
  for (int i = 0; i < 4; i++) year = year * 10 + s[6 + i] - '0';
  if (year >= 2013 && year <= 2015 && month >= 1 && month <= 12 && day >= 1 &&
      day <= 31 && day <= mon[month])
    return 1;
  else
    return 0;
}
int main() {
  string s;
  cin >> s;
  for (int i = 0; i < s.length() - 9; i++) {
    string s1(s, i, 10);
    if (isCorrect(s1)) mp[s1]++;
  }
  for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++)
    vis.push_back(make_pair(it->second, it->first));
  sort(vis.begin(), vis.end());
  cout << vis[vis.size() - 1].second << endl;
  return 0;
}
