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 hash1(string s) {
  int n = 0, b = 1;
  for (int i = 0; i < s.size(); i++, b *= 10) n += s[i] * b;
  return n;
}
int main(int argc, char const *argv[]) {
  string str;
  cin >> str;
  int s;
  int i, j, k, t, p;
  string date;
  map<int, int> m;
  map<int, string> ref;
  for (i = 0; i < str.size(); i++) {
    s = 0;
    string made = "";
    j = i - 1;
    while (1) {
      j++;
      if (s == 0) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 1;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 1) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 2;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 2) {
        if (str[j] == '-') {
          s = 3;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 3) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 4;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 4) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 5;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 5) {
        if (str[j] == '-') {
          s = 6;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 6) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 7;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 7) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 8;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 8) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 9;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 9) {
        if (str[j] >= '0' && str[j] <= '9') {
          s = 10;
          made.append(1, str[j]);
          continue;
        } else
          break;
      }
      if (s == 10) {
        string d = made.substr(0, 2);
        string mo = made.substr(3, 2);
        string y = made.substr(6, 4);
        int date, month, year;
        istringstream(d) >> date;
        istringstream(mo) >> month;
        istringstream(y) >> year;
        if (!(year >= 2013 && year <= 2015)) break;
        if (date <= 0) break;
        if (!(month >= 1 && month <= 12)) break;
        if (month == 2) {
          if (date > 28) break;
        } else if (month == 1 || month == 3 || month == 5 || month == 7 ||
                   month == 8 || month == 10 || month == 12) {
          if (date > 31) break;
        } else {
          if (date > 30) break;
        }
        int h = hash1(made);
        ref[h] = made;
        if (m.find(h) == m.end())
          m[h] = 1;
        else
          m[h] = m[h] + 1;
        break;
      }
      j++;
    }
  }
  map<int, int>::iterator it;
  int mx = 0;
  string maxs;
  for (it = m.begin(); it != m.end(); it++) {
    if (it->second > mx) {
      mx = it->second;
      maxs = ref[it->first];
    }
  }
  cout << maxs << endl;
  ;
  return 0;
}
