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;
bool isd(char first) { return '0' <= first && first <= '9'; }
int main(int argc, char **argv) {
  string s;
  cin >> s;
  int N = s.length();
  bool f = 0;
  int dd, mm, yy;
  int dom[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  map<string, int> freq;
  for (int i = (0); i < (N - 9); ++i) {
    string t = s.substr(i, 10);
    int m, d, second;
    string sm, sd, sy;
    sd = t.substr(0, 2);
    sm = t.substr(3, 2);
    sy = t.substr(6, 4);
    bool ok = 1;
    for (int j = (0); j < (sd.size()) && (ok); ++j) ok = isd(sd[j]);
    for (int j = (0); j < (sm.size()) && (ok); ++j) ok = isd(sm[j]);
    for (int j = (0); j < (sy.size()) && (ok); ++j) ok = isd(sy[j]);
    ok &= t[2] == '-' && t[5] == '-';
    if (!ok) continue;
    sscanf(sd.c_str(), "%d", &d);
    sscanf(sm.c_str(), "%d", &m);
    sscanf(sy.c_str(), "%d", &second);
    if (2012 < second && second < 2016 && 0 < m < 13) {
      if (0 < d && d <= dom[m]) {
        freq[t]++;
      }
    }
  }
  int res = -1;
  string sres;
  for (typeof(freq.begin()) t = freq.begin(); t != freq.end(); t++)
    if (res < t->second) {
      res = t->second;
      sres = t->first;
    } else if (res == t->second) {
      int yy, mm, dd;
      int second, m, d;
      sscanf(t->first.c_str(), "%d-%d-%d", &d, &m, &second);
      sscanf(sres.c_str(), "%d-%d-%d", &dd, &mm, &yy);
      bool rpl = 0;
      if (second > yy)
        rpl = 1;
      else if (second == yy && m > mm)
        rpl = 1;
      else if (second == yy && m == mm)
        rpl = d > dd;
      if (rpl) sres = t->first;
    }
  cout << sres;
  return 0;
}
