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 main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  int q = 0, w = 0, e = 0;
  string p = "";
  string s;
  cin >> s;
  vector<pair<int, string>> a;
  vector<int> b = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  a.push_back(make_pair(-1000000, "kek"));
  for (int i = 0; i < s.length(); i++) {
    if (s[i] != '-' && i + 9 < s.length() && s[i + 1] != '-' &&
        s[i + 2] == '-' && s[i + 3] != '-' && s[i + 4] != '-' &&
        s[i + 5] == '-' && s[i + 6] != '-' && s[i + 7] != '-' &&
        s[i + 8] != '-' && s[i + 9] != '-') {
      p = "";
      p.push_back(s[i]);
      p.push_back(s[i + 1]);
      p.push_back(s[i + 2]);
      p.push_back(s[i + 3]);
      p.push_back(s[i + 4]);
      p.push_back(s[i + 5]);
      p.push_back(s[i + 6]);
      p.push_back(s[i + 7]);
      p.push_back(s[i + 8]);
      p.push_back(s[i + 9]);
      for (int j = 0; j < a.size(); j++) {
        if (a[j].second != p && j == a.size() - 1) {
          a.push_back(make_pair(1, p));
          if (((int(p[0]) - '0') * 10 + int(p[1]) - '0') == 0 ||
              ((int(p[3]) - '0') * 10 + int(p[4]) - '0') == 0 ||
              ((int(p[8]) - '0') * 10 + int(p[9]) - '0') > 16 ||
              ((int(p[8]) - '0') * 10 + int(p[9]) - '0') <= 12 ||
              ((int(p[3]) - '0') * 10 + int(p[4]) - '0') > 12 ||
              b[((int(p[3]) - '0') * 10 + int(p[4]) - '0') - 1] <
                  ((int(p[0]) - '0') * 10 + int(p[1]) - '0'))
            a[a.size() - 1].first = -1100000;
          break;
        } else if (a[j].second == p) {
          a[j].first++;
        }
      }
    }
  }
  sort(a.begin(), a.end());
  cout << a[a.size() - 1].second;
  return 0;
}
