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 check(string s) {
  if (s.length() < 10) {
    return false;
  }
  if (s[2] != '-' || s[5] != '-') {
    return false;
  }
  if (s[6] != '2' || s[7] != '0' || s[8] != '1' ||
      (s[9] != '3' && s[9] != '4' && s[9] != '5')) {
    return false;
  }
  if (s[0] < '0' || s[0] > '3') return false;
  if (s[1] < '0' || s[1] > '9') return false;
  if (s[3] < '0' || s[3] > '2') return false;
  if (s[4] < '0' || s[4] > '9') return false;
  long long d = (long long)(s[0] - '0') * 10 + (long long)(s[1] - '0');
  long long m = (long long)(s[3] - '0') * 10 + (long long)(s[4] - '0');
  if (m < 1 || m > 12) {
    return false;
  }
  if (m == 4 || m == 6 || m == 9 || m == 11) {
    if (d < 1 || d > 30) {
      return false;
    }
  } else if (m == 2) {
    if (d < 1 || d > 28) {
      return false;
    }
  } else {
    if (d < 1 || d > 31) {
      return false;
    }
  }
  return true;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  map<string, long long> mp;
  long long n = s.length();
  for (long long i = 0; i < n; i++) {
    string s1 = s.substr(i, 10);
    if (check(s1)) {
      mp[s1]++;
    }
  }
  long long maxi = -1;
  string s2;
  for (auto j : mp) {
    if (j.second > maxi) {
      maxi = j.second;
      s2 = j.first;
    }
  }
  cout << s2 << "\n";
  return 0;
}
