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;
long long get() {
  char c = getchar();
  long long x = 0LL;
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') {
    x *= 10LL;
    x += (c - '0');
    c = getchar();
  }
  return x;
}
string s;
int dm[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
map<string, int> mp;
int main() {
  ios::sync_with_stdio(0);
  cin >> s;
  for (int i = 0; i < s.size() - 9; i++) {
    string t = s.substr(i, 10);
    string d = t.substr(0, 2), m = t.substr(3, 2), y = t.substr(6, 4);
    if (t[2] != '-' || t[5] != '-') continue;
    bool f = true;
    for (int j = 0; j < 2; j++)
      if (!isdigit(d[j]) || !isdigit(m[j])) f = false;
    for (int j = 0; j < 4; j++)
      if (!isdigit(y[j])) f = false;
    if (!f) continue;
    int dd, mm, yy;
    dd = mm = yy = 0;
    for (int j = 0; j < 2; j++) {
      dd = dd * 10 + (d[j] - '0');
      mm = mm * 10 + (m[j] - '0');
    }
    for (int j = 0; j < 4; j++) yy = yy * 10 + (y[j] - '0');
    if (dd < 1 || dd > dm[mm]) continue;
    if (mm < 1 || mm > 12) continue;
    if (yy < 2013 || yy > 2015) continue;
    mp[t]++;
  }
  int mx = 0;
  for (__typeof(mp.begin()) it = (mp.begin()); it != (mp).end(); it++) {
    if (it->second > mx) mx = it->second;
  }
  for (__typeof(mp.begin()) it = (mp.begin()); it != (mp).end(); it++) {
    if (it->second == mx) {
      cout << it->first;
      return 0;
    }
  }
  return 0;
}
