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 str, s, rezz, datums[40005];
int i, j, k, d, m, y, n, z, rez;
int monthdays[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int mas[40005], bijan[40005];
int main() {
  cin >> str;
  k = str.length() - 9;
  for (i = 0; i < k; ++i) {
    s = str.substr(i, 10);
    m = 0;
    for (j = 0; j < 10; ++j) {
      if (s[j] == '-') {
        ++m;
      }
    }
    if (((m == 2) && (s[2] == '-')) && (s[5] == '-')) {
      d = (s[0] - '0') * 10 + s[1] - '0';
      m = (s[3] - '0') * 10 + s[4] - '0';
      y = (s[6] - '0') * 1000 + (s[7] - '0') * 100 + (s[8] - '0') * 10 + s[9] -
          '0';
      if ((((y >= 2013) && (y <= 2015)) &&
           ((m <= 12) && (d <= monthdays[m]))) &&
          ((d > 0) && (m > 0))) {
        n = (2016 - y) * 10000 + m * 100 + d;
        ++mas[n];
        if (mas[n] == 1) {
          bijan[z] = n;
          datums[z] = s;
          ++z;
        }
        rez = max(rez, mas[n]);
      }
    }
  }
  for (i = 0; i < z; ++i) {
    if (mas[bijan[i]] == rez) {
      cout << datums[i];
    }
  }
  return 0;
}
