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 INF = 2147483647;
int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int to_int(string s) {
  stringstream ss;
  if (s.find('-') != -1) return 0;
  ss << s;
  int r = 0;
  ss >> r;
  return r;
}
bool check(string s) {
  if (s.length() != 10 || s[2] != '-' || s[5] != '-') return false;
  int d = to_int(s.substr(0, 2));
  int m = to_int(s.substr(3, 2));
  int y = to_int(s.substr(6, 4));
  if (y < 2013 || y > 2015 || m < 1 || m > 12 || d < 1 || d > days[m - 1])
    return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  map<string, int> m;
  for (int i = 0; i < s.size() - 9; i++) {
    string sub = s.substr(i, 10);
    if (!check(sub)) continue;
    if (m.count(sub))
      m.find(sub)->second++;
    else
      m.insert(pair<string, int>(sub, 1));
  }
  pair<string, int> ans = *m.begin();
  for (map<string, int>::iterator it = m.begin(); it != m.end(); it++)
    if (it->second > ans.second) ans = *it;
  cout << ans.first << endl;
  return 0;
}
