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;
const int M = 1e5 + 5;
char pro[M];
map<string, int> mp;
int moon[15] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool OK(string a) {
  int len = a.length();
  int year, month, day;
  year = (a[len - 4] - '0') * 1000 + (a[len - 3] - '0') * 100 +
         (a[len - 2] - '0') * 10 + (a[len - 1] - '0');
  if (year > 2015 || year < 2013) {
    return false;
  }
  month = (a[len - 7] - '0') * 10 + (a[len - 6] - '0');
  if (month < 1 || month > 12) {
    return false;
  }
  day = (a[len - 10] - '0') * 10 + (a[len - 9] - '0');
  if (day < 1 || day > moon[month]) {
    return false;
  }
  return true;
}
bool judge(int i) {
  if (pro[i] != '-' && pro[i + 1] != '-' && pro[i + 2] == '-' &&
      pro[i + 3] != '-' && pro[i + 4] != '-' && pro[i + 5] == '-' &&
      pro[i + 6] != '-' && pro[i + 7] != '-' && pro[i + 8] != '-' &&
      pro[i + 9] != '-') {
    return true;
  }
  return false;
}
int main() {
  scanf("%s", pro);
  int len = strlen(pro);
  for (int i = 0; i < len - 9; i++) {
    if (judge(i)) {
      char temp[15];
      memcpy(temp, pro + i, 10);
      temp[10] = '\0';
      mp[temp]++;
    }
  }
  map<string, int>::iterator k = mp.begin();
  int num = 0;
  string ans;
  for (; k != mp.end(); k++) {
    if (num < (k->second) && OK(k->first)) {
      num = (k->second);
      ans = k->first;
    }
  }
  cout << ans << endl;
  return 0;
}
