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>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
typedef struct coor {
  int x, y;
};
int nomalDay[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int leapDay[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int ARRSIZE = 100100;
const int STRSIZE = 100100;
const int GRIDSIZE = 510;
const int MAXINF = (2 << 20);
const int MININF = (~(2 << 20));
inline bool upcmp(int a, int b) { return a < b; }
inline bool downcmp(int a, int b) { return a > b; }
int hs[50][50][10];
int main() {
  string s, res;
  cin >> s;
  int i, j, len = (int)s.size(), Max = MININF;
  for (i = 0; i < len - 8; i++) {
    string tp = "";
    int cnt = 0;
    for (j = 0; j < 10; j++) {
      tp += s[i + j];
      if (s[i + j] == '-') cnt++;
    }
    if (cnt > 2) continue;
    int day = (tp[0] - '0') * 10 + tp[1] - '0';
    int mon = (tp[3] - '0') * 10 + tp[4] - '0';
    int year = (tp[6] - '0') * 1000 + (tp[7] - '0') * 100 + (tp[8] - '0') * 10 +
               tp[9] - '0';
    if (tp[2] != '-' || tp[5] != '-') continue;
    if (year < 2013 || year > 2015) continue;
    if (mon < 1 || mon > 12) continue;
    if (day > nomalDay[mon] || day < 1) continue;
    int h1 = hs[day][mon][year - 2013]++;
    h1++;
    if (h1 > Max) {
      res = tp;
      Max = h1;
    }
  }
  cout << res << endl;
  return 0;
}
