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 ctoi(char c) { return int(c - '0'); }
bool goodDate(string s) {
  if (s[9] < '3' || s[9] > '5' || s[8] != '1' || s[7] != '0' || s[6] != '2' ||
      s[9] == '-')
    return false;
  if (s[5] != '-') return false;
  if (s[3] > '1' || s[3] == '-') return false;
  if (s[3] == '1') {
    if (s[4] > '2' || s[4] == '-') return false;
  } else {
    if (s[4] == '0' || s[4] == '-') return false;
  }
  if (s[2] != '-') return false;
  int men = ctoi(s[3]) * 10 + ctoi(s[4]);
  if (s[0] == '-' || s[1] == '-') return false;
  int dien = ctoi(s[0]) * 10 + ctoi(s[1]);
  if (dien == 0) return false;
  if (men == 1 || men == 3 || men == 5 || men == 7 || men == 8 || men == 10 ||
      men == 12) {
    if (dien > 31) return false;
  } else if (men == 4 || men == 6 || men == 9 || men == 11) {
    if (dien > 30) return false;
  } else {
    if (dien > 28) return false;
  }
  return true;
}
map<string, int> dq;
int main() {
  string s;
  cin >> s;
  for (int i = 0; i < s.size() - 9; i++) {
    string date = s.substr(i, 10);
    if (goodDate(date)) {
      dq[date]++;
    }
  }
  map<string, int>::iterator it;
  int best = 0;
  string bestDate = "";
  for (it = dq.begin(); it != dq.end(); it++) {
    if ((*it).second > best) {
      best = (*it).second;
      bestDate = (*it).first;
    }
  }
  cout << bestDate << endl;
}
