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 day[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dm(string str) {
  int s;
  s = (int)str[0] - 48;
  s = (s * 10) + (int)str[1] - 48;
  return s;
}
int year(string str) {
  int s;
  s = (int)str[0] - 48;
  s = (s * 10) + (int)str[1] - 48;
  s = (s * 10) + (int)str[2] - 48;
  s = (s * 10) + (int)str[3] - 48;
  return s;
}
bool iscorrect(string str) {
  if (str[2] != '-' || str[5] != '-') return false;
  int d, m, y, cnt = 0;
  for (int i = 0; i < str.size(); i++)
    if (str[i] == '-') cnt++;
  if (cnt > 2) return false;
  y = year(str.substr(6, 4));
  m = dm(str.substr(3, 2));
  d = dm(str.substr(0, 2));
  if (y < 2013 || y > 2015) return false;
  if (m < 1 || m > 12) return false;
  if (d < 1 || d > day[m]) return false;
  return true;
}
int main() {
  map<string, int> mp;
  map<string, int>::iterator it;
  string str, tmp;
  cin >> str;
  mp.clear();
  for (int i = 0; i <= str.size() - 10; i++) {
    tmp = str.substr(i, 10);
    if (iscorrect(tmp)) {
      if (mp.find(tmp) == mp.end())
        mp[tmp] = 1;
      else
        mp[tmp]++;
    }
  }
  int max = -1;
  for (it = mp.begin(); it != mp.end(); ++it) {
    if (it->second > max) {
      max = it->second;
      tmp = it->first;
    }
  }
  cout << tmp << endl;
}
