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 stoi(string &s) {
  int n = 0;
  for (int i = 0; i < s.size(); i++) {
    n *= 10;
    n += s[i] - 48;
  }
  return n;
}
string itos(int n) {
  string s;
  s.push_back(n / 10 + 48);
  s.push_back(n % 10 + 48);
  return s;
}
int date[32][13][3];
int main() {
  string s;
  cin >> s;
  int d, m, y;
  for (int i = 6; i < s.size() - 3; i++) {
    string yyyy = s.substr(i, 4);
    if (yyyy == "2013" || yyyy == "2014" || yyyy == "2015") {
      if (s[i - 1] != '-') continue;
      if (s[i - 2] == '-') continue;
      if (s[i - 3] == '-') continue;
      if (s[i - 4] != '-') continue;
      if (s[i - 5] == '-') continue;
      if (s[i - 6] == '-') continue;
      y = stoi(yyyy);
      string dd = s.substr(i - 6, 2);
      string mm = s.substr(i - 3, 2);
      d = stoi(dd);
      m = stoi(mm);
      switch (m) {
        case 1:
          if (d > 31) d = -1;
          break;
        case 2:
          if (d > 28) d = -1;
          break;
        case 3:
          if (d > 31) d = -1;
          break;
        case 4:
          if (d > 30) d = -1;
          break;
        case 5:
          if (d > 31) d = -1;
          break;
        case 6:
          if (d > 30) d = -1;
          break;
        case 7:
          if (d > 31) d = -1;
          break;
        case 8:
          if (d > 31) d = -1;
          break;
        case 9:
          if (d > 30) d = -1;
          break;
        case 10:
          if (d > 31) d = -1;
          break;
        case 11:
          if (d > 30) d = -1;
          break;
        case 12:
          if (d > 31) d = -1;
          break;
        default:
          d = -1;
          break;
      }
      if (d == -1 || d == 0) continue;
      date[d][m][y - 2013]++;
    }
  }
  int t = 0;
  for (int i = 0; i < 32; i++)
    for (int j = 0; j < 13; j++)
      for (int k = 0; k < 3; k++)
        if (t < date[i][j][k]) {
          d = i;
          m = j;
          y = k + 2013;
          t = date[i][j][k];
        }
  string dd = itos(d);
  string mm = itos(m);
  cout << dd << "-" << mm << "-" << y;
  return 0;
}
