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;
long long int M = 1000000007;
long long int gcd(long long int a, long long int b) {
  return (b == 0) ? a : gcd(b, a % b);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    map<string, string> months;
    months["01"] = "31";
    months["02"] = "28";
    months["03"] = months["05"] = months["07"] = months["08"] = months["10"] =
        months["12"] = "31";
    months["04"] = months["06"] = months["09"] = months["11"] = "30";
    map<string, long long int> m;
    string s;
    cin >> s;
    for (long long int i = 6; i < s.length() - 3; i++) {
      if (s.substr(i, 3) == "201") {
        if (s[i + 3] == '3' || s[i + 3] == '4' || s[i + 3] == '5') {
          if (s[i - 1] == '-' && s[i - 4] == '-' && s[i - 6] != '-' &&
              s[i - 5] != '-' && s[i - 3] != '-' && s[i - 2] != '-') {
            if (s.substr(i - 3, 2) >= "01" && s.substr(i - 3, 2) <= "12") {
              string sub = s.substr(i - 3, 2);
              string day = s.substr(i - 6, 2);
              if (day >= "01" && day <= months[sub]) {
                if (m.count(s.substr(i - 6, 10)) == 0)
                  m[s.substr(i - 6, 10)] = 1;
                else
                  m[s.substr(i - 6, 10)] += 1;
              }
            }
          }
        }
      }
    }
    long long int mx = 0;
    string ans;
    for (auto i : m) {
      if (i.second > mx) {
        mx = i.second;
        ans = i.first;
      }
    }
    cout << ans << "\n";
  }
  return 0;
}
