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 s;
int cnt[2016][13][32], Max, ansY, ansM, ansD;
int main() {
  getline(cin, s);
  Max = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] >= '0' && s[i] <= '9') {
      int d = s[i] - '0';
      if (s[i + 1] >= '0' && s[i + 1] <= '9') {
        d = d * 10 + (s[i + 1] - '0');
        if (d == 0 || d > 31) continue;
        if (s[i + 2] == '-') {
          if (s[i + 3] >= '0' && s[i + 3] <= '9') {
            int m = s[i + 3] - '0';
            if (s[i + 4] >= '0' && s[i + 4] <= '9') {
              m = m * 10 + (s[i + 4] - '0');
              if (m == 0 || m > 12) continue;
              if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 ||
                  m == 12) {
                if (d > 31) continue;
              } else if (m == 2) {
                if (d > 28) continue;
              } else {
                if (d > 30) continue;
              }
              if (s[i + 5] == '-') {
                if (s[i + 6] == '2') {
                  if (s[i + 7] == '0') {
                    if (s[i + 8] == '1') {
                      if (s[i + 9] >= '3' && s[i + 9] <= '5') {
                        int y = 2010 + (s[i + 9] - '0');
                        cnt[y][m][d]++;
                        if (cnt[y][m][d] > Max) {
                          Max = cnt[y][m][d];
                          ansY = y;
                          ansM = m;
                          ansD = d;
                        }
                      }
                    }
                  }
                }
              }
            }
          }
        }
      }
    }
  }
  if (ansD >= 10) {
    printf("%d", ansD);
  } else {
    printf("0%d", ansD);
  }
  printf("-");
  if (ansM >= 10) {
    printf("%d", ansM);
  } else {
    printf("0%d", ansM);
  }
  printf("-");
  printf("%d\n", ansY);
  return 0;
}
