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 double eps(1e-8);
const double pi(3.14159265358979);
const int N = 100100;
const int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
char ch[N] = {};
int main() {
  gets(ch + 1);
  int l = strlen(ch + 1);
  map<int, int> bucket;
  for (int i = 3; i <= l - 7; ++i)
    if (ch[i] == '-' && ch[i + 3] == '-') {
      bool flag = isdigit(ch[i - 2]);
      flag &= isdigit(ch[i - 1]);
      flag &= isdigit(ch[i + 1]);
      flag &= isdigit(ch[i + 2]);
      flag &= isdigit(ch[i + 4]);
      flag &= isdigit(ch[i + 5]);
      flag &= isdigit(ch[i + 6]);
      flag &= isdigit(ch[i + 7]);
      if (!flag) continue;
      int d = (ch[i - 2] - '0') * 10 + ch[i - 1] - '0';
      int m = (ch[i + 1] - '0') * 10 + ch[i + 2] - '0';
      int y = (((ch[i + 4] - '0') * 10 + (ch[i + 5] - '0')) * 10 + ch[i + 6] -
               '0') *
                  10 +
              ch[i + 7] - '0';
      if (2013 <= y && y <= 2015 && 1 <= m && m <= 12 && 1 <= d &&
          d <= month[m])
        ++bucket[d * 1000000 + m * 10000 + y];
    }
  int d1 = 0, m1 = 0, y1 = 0, t = 0;
  for (auto p : bucket)
    if (p.second > t)
      d1 = p.first / 1000000, m1 = p.first % 1000000 / 10000,
      y1 = p.first % 10000, t = p.second;
  printf("%02d-%02d-%d\n", d1, m1, y1);
  return 0;
}
