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 MAXN = 1e9;
map<string, int> my_map;
int m_days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
  string inp;
  cin >> inp;
  for (int i = 0; i < inp.size(); i++) {
    string buff = inp.substr(i, 10);
    bool flag = false;
    if (buff[2] != '-' || buff[5] != '-') flag = true;
    for (int j = 0; j < 10; j++)
      if (j != 2 && j != 5 && buff[j] == '-') flag = true;
    if (flag) continue;
    int date = (buff[0] - '0') * 10 + (buff[1] - '0');
    int month = (buff[3] - '0') * 10 + (buff[4] - '0');
    int year = (buff[6] - '0') * 1000 + (buff[7] - '0') * 100 +
               (buff[8] - '0') * 10 + (buff[9] - '0');
    if (year >= 2013 && year <= 2015)
      if (month >= 1 && month <= 12)
        if (date && date <= m_days[month - 1]) my_map[buff]++;
  }
  map<string, int>::iterator mx = my_map.begin();
  for (map<string, int>::iterator i = mx; i != my_map.end(); i++)
    if (i->second > mx->second) mx = i;
  cout << mx->first << endl;
  return 0;
}
