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;
string in;
map<string, int> m;
int meses[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main(int argc, char *argv[]) {
  cin >> in;
  for (int i = 2; i < in.size() - 7; ++i) {
    if (in[i] == '-') {
      string date(in.c_str() + i - 2, 10);
      int contador = 0;
      for (int j = 0; j < date.size(); ++j)
        if (date[j] == '-') contador++;
      if (date[2] == '-' && date[5] == '-' && date[0] != '-' && contador == 2) {
        m[date]++;
        date.clear();
      }
    }
  }
  int maior = -1;
  string in;
  for (map<string, int>::iterator it = m.begin(); it != m.end(); ++it) {
    int day, month, year;
    sscanf((*it).first.c_str(), "%d-", &day);
    sscanf((*it).first.c_str() + 3, "%d-", &month);
    sscanf((*it).first.c_str() + 6, "%d", &year);
    if ((*it).second > maior && year >= 2013 && year <= 2015)
      if (day >= 1 && month >= 1 && month <= 12 && day <= meses[month - 1]) {
        maior = (*it).second;
        in = (*it).first;
      }
  }
  cout << in << endl;
  return 0;
}
