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;
int64_t m[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  map<string, int64_t> date;
  string s;
  cin >> s;
  s = "00" + s;
  int64_t n = s.length();
  for (int64_t i = 0; i < n - 8; ++i) {
    string a = s.substr(i, 9);
    if (count((a).begin(), (a).end(), '-') == 2 and a[2] == '-' and
        a[4] == '-') {
      int64_t day = stoi(a.substr(0, 2));
      int64_t month = stoi(a.substr(3, 1));
      int64_t year = stoi(a.substr(5, 4));
      if (month >= 1 and month <= 12 and day >= 1 and day <= m[month - 1] and
          year >= 2013 and year <= 2015) {
        string real;
        real += a[0], real += a[1], real += '-', real += '0', real += a[3],
            real += '-', real += a.substr(5, 4);
        date[real]++;
        cout << a << '\n';
      }
    }
  }
  for (int64_t i = 0; i < n - 9; ++i) {
    string a = s.substr(i, 10);
    if (count((a).begin(), (a).end(), '-') == 2 and a[2] == '-' and
        a[5] == '-') {
      int64_t day = stoi(a.substr(0, 2));
      int64_t month = stoi(a.substr(3, 2));
      int64_t year = stoi(a.substr(6, 4));
      if (month >= 1 and month <= 12 and day >= 1 and day <= m[month - 1] and
          year >= 2013 and year <= 2015) {
        string real;
        real += a.substr(0, 2), real += '-', real += a.substr(3, 2),
            real += '-', real += a.substr(6, 4);
        date[real]++;
      }
    }
  }
  int64_t best = 0;
  string val;
  for (auto& x : date) {
    if (x.second >= best) {
      best = x.second;
      val = x.first;
    }
  }
  cout << val;
}
