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 days[13] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool validity(string s) {
  for (int i = 0; i < 10; i++) {
    if (i == 2 || i == 5) {
      if (s[i] == '-')
        continue;
      else
        return false;
    }
    if (s[i] >= '0' && s[i] <= '9')
      continue;
    else
      return false;
  }
  int d = (s[0] - '0') * 10 + (s[1] - '0');
  int m = (s[3] - '0') * 10 + (s[4] - '0');
  int y = (s[6] - '0') * 1000 + (s[7] - '0') * 100 + (s[8] - '0') * 10 +
          (s[9] - '0');
  if (y < 2013 || y > 2015) return false;
  if (m < 1 || m > 12) return false;
  if (d < 1 || d > days[m]) return false;
  return true;
}
int main() {
  map<string, int> m;
  map<string, int>::iterator it;
  int max = 0;
  string s, tmp, proph;
  cin >> s;
  int len = s.length();
  for (int i = 0; i + 10 <= len; i++) {
    tmp = s.substr(i, 10);
    bool f = validity(tmp);
    if (f) {
      it = m.find(tmp);
      if (it == m.end()) {
        m.insert(make_pair(tmp, 1));
        if (max == 0) {
          max = 1;
          proph = tmp;
        }
      } else {
        int f = it->second;
        f++;
        if (f > max) {
          max = f;
          proph = tmp;
        }
        m.erase(it);
        m.insert(make_pair(tmp, f));
      }
    }
  }
  cout << proph << endl;
}
