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;
const long long int mod = 1000000000 + 7;
const long long int N = 10000000 + 6;
int cal[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool check(int d, int m) {
  if (m <= 12 && m > 0) {
    if (d >= 1 && d <= cal[m]) return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string st;
  cin >> st;
  int n = st.size();
  unordered_map<string, int> hmap;
  for (int i = 0, j = 9; j < n; i++, j++) {
    string sub = st.substr(i, 10);
    if (sub[2] == '-' && sub[5] == '-') {
      if (sub[6] == '2' && sub[7] == '0' && sub[8] == '1' &&
          (sub[9] - '3' >= 0 && sub[9] - '3' <= 2)) {
        if (isdigit(sub[0]) && isdigit(sub[1]) && isdigit(sub[3]) &&
            isdigit(sub[4])) {
          string mo = "";
          string da = "";
          mo = mo + sub[3] + sub[4];
          da = da + sub[0] + sub[1];
          int month = stoi(mo);
          int day = stoi(da);
          bool b = check(day, month);
          if (b == true) hmap[sub]++;
        }
      }
    }
  }
  string ans;
  int ma = -1;
  for (auto it = hmap.begin(); it != hmap.end(); it++) {
    if (it->second > ma) {
      ans = it->first;
      ma = it->second;
    }
  }
  cout << ans;
  return 0;
}
