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;
string kip[100005];
int rec[100005], a[100005];
char s[100005];
map<string, int> mm;
string cur;
int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline bool chk(int id) {
  int flag, i, d1, m1, y1;
  flag = true;
  cur.clear();
  for (i = id; i < id + 10; i++) {
    if (i == (id + 2) || i == (id + 5)) {
      if (s[i] != '-') flag = false;
    } else {
      if (s[i] > '9' || s[i] < '0') flag = false;
    }
    a[i] = s[i] - '0';
    cur = cur + s[i];
  }
  char b = 0;
  cur = cur + b;
  if (flag == false) return false;
  d1 = a[id] * 10 + a[id + 1];
  m1 = a[id + 3] * 10 + a[id + 4];
  y1 = a[id + 6] * 1000 + a[id + 7] * 100 + a[id + 8] * 10 + a[id + 9];
  flag = false;
  if (2012 < y1 && y1 < 2016) {
    if (0 < m1 && m1 < 13) {
      if (0 < d1 && d1 <= mon[m1]) {
        flag = true;
      }
    }
  }
  return flag;
}
int main() {
  int k, mxnow, cnt, i;
  scanf("%s", s);
  k = strlen(s);
  mm.clear();
  mxnow = -1;
  cnt = 1;
  for (i = 0; i < k - 9; i++) {
    if (chk(i) == false) continue;
    if (mm.find(cur) == mm.end()) {
      mm[cur] = cnt;
      rec[cnt] = 0;
      kip[cnt] = cur;
      cnt++;
    }
    int now;
    now = mm[cur];
    rec[now]++;
    mxnow = max(rec[now], mxnow);
  }
  for (i = 1; i < cnt; i++) {
    if (rec[i] == mxnow) {
      printf("%s\n", kip[i].c_str());
      break;
    }
  }
  return 0;
}
