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() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    map<string, int> mp;
    string s;
    cin >> s;
    int n = int((s).size());
    for (int i = 0; i < n - 9; i++) {
      if (isdigit(s[i]) && s[i + 2] == '-' && s[i + 5] == '-') {
        string sub = s.substr(i, 10);
        char ch = '-';
        int c = count((sub).begin(), (sub).end(), ch);
        if (c != 2) {
          continue;
        }
        string D, M, Y;
        D = sub.substr(0, 2);
        M = sub.substr(3, 2);
        Y = sub.substr(6, 4);
        int d = stoi(D);
        int m = stoi(M);
        int y = stoi(Y);
        if (y >= 2013 && y <= 2015) {
          if (m >= 1 && m <= 12) {
            if (m == 2) {
              if (d >= 1 && d <= 28) {
                mp[sub]++;
              }
            } else if (m == 4 || m == 6 || m == 9 || m == 11) {
              if (d >= 1 && d <= 30) {
                mp[sub]++;
              }
            } else {
              if (d >= 1 && d <= 31) {
                mp[sub]++;
              }
            }
          }
        }
      }
    }
    int maxi = 0;
    string ans;
    for (auto x : mp) {
      if (x.second > maxi) {
        maxi = x.second;
        ans = x.first;
      }
    }
    cout << ans;
  }
  return 0;
}
