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;
char s[100005];
int num[100005];
map<int, string> ans;
map<string, int> mp;
int mouth[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int k = 1;
void judge(int i) {
  char ss[20];
  int l = 0;
  if (s[i + 2] != '-' || s[i + 5] != '-') return;
  for (int j = i; j < i + 10; j++) {
    ss[l++] = s[j];
    if (j == i + 2 || j == i + 5) continue;
    if (!(s[j] >= '0' && s[j] <= '9')) return;
  }
  ss[l] = '\0';
  int dd = (s[i] - '0') * 10 + s[i + 1] - '0';
  int mm = (s[i + 3] - '0') * 10 + s[i + 4] - '0';
  int yy = 0;
  for (int j = i + 6; j < i + 10; j++) {
    yy = yy * 10 + s[j] - '0';
  }
  if (!(yy >= 2013 && yy <= 2015)) return;
  if (!(mm >= 1 && mm <= 12)) return;
  if (!(dd >= 1 && dd <= mouth[mm])) return;
  if (!mp[ss]) {
    ans[k] = ss;
    mp[ss] = k++;
  }
  num[mp[ss]]++;
}
int main() {
  cin >> s;
  int len = strlen(s);
  for (int i = 0; i <= len - 10; i++) {
    judge(i);
  }
  int index, max_ = -1;
  for (int i = 1; i < k; i++) {
    if (num[i] > max_) {
      max_ = num[i];
      index = i;
    }
  }
  cout << ans[index];
  return 0;
}
