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 d, m, y, res;
string line, cur, best;
map<string, int> s;
int main() {
  res = 0;
  getline(cin, line);
  for (int i = (0); i < (line.length() + 1); i++) {
    cur.clear();
    for (int j = (0); j < (10); j++) cur += line[i + j];
    if (!isdigit(cur[0]) || !isdigit(cur[1]) || !isdigit(cur[3]) ||
        !isdigit(cur[4]) || !isdigit(cur[6]) || !isdigit(cur[7]) ||
        !isdigit(cur[8]) || !isdigit(cur[9]) || isdigit(cur[2]) ||
        isdigit(cur[5]))
      continue;
    d = 10 * (cur[0] - '0') + (cur[1] - '0');
    m = 10 * (cur[3] - '0') + (cur[4] - '0');
    y = 1000 * (cur[6] - '0') + 100 * (cur[7] - '0') + 10 * (cur[8] - '0') +
        (cur[9] - '0');
    if (m < 1 || m > 12 || y < 2013 || y > 2015) continue;
    if (d < 1) continue;
    if (m < 8) {
      if (m % 2) {
        if (d > 31) continue;
      } else {
        if (d > 30 || (m == 2 && d > 28)) continue;
      }
    } else {
      if (m % 2) {
        if (d > 30) continue;
      } else {
        if (d > 31) continue;
      }
    }
    map<string, int>::iterator it = s.find(cur);
    if (it == s.end()) {
      s.insert(make_pair(cur, 1));
      if (!res) {
        res = 1;
        best = cur;
      }
    } else {
      ++it->second;
      if (it->second > res) {
        res = it->second;
        best = cur;
      }
    }
  }
  cout << best << endl;
  return 0;
}
