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;
int main() {
  int a[13] = {0};
  a[1] = 31;
  a[2] = 28;
  a[3] = 31;
  a[4] = 30;
  a[5] = 31;
  a[6] = 30;
  a[7] = 31;
  a[8] = 31;
  a[9] = 30;
  a[10] = 31;
  a[11] = 30;
  a[12] = 31;
  int b[3][13][40];
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j <= 12; j++) {
      for (int k = 0; k < 40; k++) {
        b[i][j][k] = 0;
      }
    }
  }
  string s;
  cin >> s;
  int n = s.size();
  for (int i = 0; i <= n - 10; i++) {
    if ((s[i] != '-') && (s[i + 1] != '-') && (s[i + 2] == '-') &&
        (s[i + 3] != '-') && (s[i + 4] != '-') && (s[i + 5] == '-') &&
        (s[i + 6] != '-') && (s[i + 7] != '-') && (s[i + 8] != '-') &&
        (s[i + 9] != '-')) {
      int d, m, y;
      d = ((((int)s[i]) - 48) * 10) + (((int)s[i + 1]) - 48);
      m = ((((int)s[i + 3]) - 48) * 10) + (((int)s[i + 4]) - 48);
      y = ((((int)s[i + 6]) - 48) * 1000) + ((((int)s[i + 7]) - 48) * 100) +
          ((((int)s[i + 8]) - 48) * 10) + (((int)s[i + 9]) - 48);
      if ((y <= 2015) && (y >= 2013)) {
        if ((m > 0) && (m <= 12)) {
          if ((d > 0) && (d <= a[m])) {
            b[y - 2013][m][d] += 1;
          }
        }
      }
    }
  }
  int d1, m1, y1;
  int maxx = 0;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j <= 12; j++) {
      for (int k = 0; k < 40; k++) {
        if (b[i][j][k] > maxx) {
          maxx = b[i][j][k];
          y1 = i + 2013;
          m1 = j;
          d1 = k;
        }
      }
    }
  }
  if ((d1 > 9) && (m1 > 9)) {
    cout << d1 << "-" << m1 << "-" << y1 << endl;
  }
  if ((d1 > 9) && (m1 < 10)) {
    cout << d1 << "-" << 0 << m1 << "-" << y1 << endl;
  }
  if ((d1 < 10) && (m1 > 9)) {
    cout << d1 << "-" << m1 << "-" << y1 << endl;
  }
  if ((d1 < 10) && (m1 < 10)) {
    cout << 0 << d1 << "-" << 0 << m1 << "-" << y1 << endl;
  }
}
