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 MAXN = 100100;
const bool digitPos[] = {1, 1, 0, 1, 1, 0, 1, 1, 1, 1};
const int digitPosNum = 10;
const int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
char s[MAXN];
inline bool isDigit(char ch) { return ch >= '0' && ch <= '9'; }
inline int getNum(const char *str, int n) {
  int res = 0;
  for (int i = 0; i < n; ++i) {
    res = res * 10 + str[i] - '0';
  }
  return res;
}
inline void printZero(int x) {
  if (x < 10) {
    printf("0");
  }
  printf("%d", x);
}
struct Date {
  int year, month, day;
  int time;
  bool tryParse(const char *date) {
    for (int i = 0; i < digitPosNum; ++i) {
      if (digitPos[i]) {
        if (!isDigit(date[i])) {
          return false;
        }
      } else {
        if (date[i] != '-') {
          return false;
        }
      }
    }
    day = getNum(date, 2);
    month = getNum(date + 3, 2);
    year = getNum(date + 6, 4);
    if (year < 2013 || year > 2015) {
      return false;
    }
    if (month < 1 || month > 12) {
      return false;
    }
    if (day < 1 || day > days[month]) {
      return false;
    }
    time = year * 10000 + month * 100 + day;
    return true;
  }
  bool operator<(const Date &date) const { return time < date.time; }
  void output() {
    printZero(day);
    printf("-");
    printZero(month);
    printf("-%d\n", year);
  }
};
map<Date, int> dateNum;
int main() {
  while (~scanf("%s", s)) {
    Date date;
    dateNum.clear();
    for (int i = 0; s[i]; ++i) {
      if (date.tryParse(s + i)) {
        ++dateNum[date];
      }
    }
    int ans = 0;
    for (map<Date, int>::iterator it = dateNum.begin(); it != dateNum.end();
         ++it) {
      if (it->second > ans) {
        ans = it->second;
        date = it->first;
      }
    }
    date.output();
  }
  return 0;
}
