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;
bool validate(string temp) {
  if (temp[0] == '-' || temp[1] == '-' || temp[2] != '-' || temp[3] == '-' ||
      temp[4] == '-' || temp[5] != '-')
    return false;
  string d = "", m = "";
  d += temp[0];
  d += temp[1];
  m += temp[3];
  m += temp[4];
  int mm = atoi(m.c_str());
  int dd = atoi(d.c_str());
  if (mm > 12 || mm < 1) return false;
  switch (mm) {
    case 1:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 2:
      if (!(dd <= 28 && dd >= 1)) return false;
      break;
    case 3:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 4:
      if (!(dd <= 30 && dd >= 1)) return false;
      break;
    case 5:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 6:
      if (!(dd <= 30 && dd >= 1)) return false;
      break;
    case 7:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 8:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 9:
      if (!(dd <= 30 && dd >= 1)) return false;
      break;
    case 10:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
    case 11:
      if (!(dd <= 30 && dd >= 1)) return false;
      break;
    case 12:
      if (!(dd <= 31 && dd >= 1)) return false;
      break;
  }
  return true;
}
int main() {
  string in;
  cin >> in;
  string x = "2013", y = "2014", z = "2015";
  map<string, int> X;
  for (int i = 0; i < in.size(); i++) {
    string temp = in.substr(i, 4);
    if (strcmp(temp.c_str(), x.c_str()) == 0) {
      temp = in.substr(i - 6, 10);
      if (validate(temp)) {
        if (X.find(temp) == X.end()) {
          X[temp] = 1;
        } else
          X[temp]++;
      }
    }
    if (strcmp(temp.c_str(), y.c_str()) == 0) {
      temp = in.substr(i - 6, 10);
      if (validate(temp)) {
        if (X.find(temp) == X.end()) {
          X[temp] = 1;
        } else
          X[temp]++;
      }
    }
    if (strcmp(temp.c_str(), z.c_str()) == 0) {
      temp = in.substr(i - 6, 10);
      if (validate(temp)) {
        if (X.find(temp) == X.end()) {
          X[temp] = 1;
        } else
          X[temp]++;
      }
    }
  }
  map<string, int>::iterator it, ret;
  int max = 0;
  for (it = X.begin(); it != X.end(); it++) {
    if ((*it).second > max) {
      max = (*it).second;
      ret = it;
    }
  }
  cout << (*ret).first << endl;
  return 0;
}
