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>
template <typename T>
T inline SQR(const T &a) {
  return a * a;
}
template <typename T>
T inline ABS(const T &a) {
  return a < 0 ? -a : a;
}
const double EPS = 1e-9;
inline int SGN(double a) {
  return ((a > EPS) ? (1) : ((a < -EPS) ? (-1) : (0)));
}
inline int CMP(double a, double b) { return SGN(a - b); }
using namespace std;
int ndays[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main(int argc, char *argv[]) {
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  map<string, int> occ;
  int i = 0, j = 9;
  while (j < int((s).size())) {
    if (s[i + 2] == s[i + 5] && s[i + 5] == '-') {
      int mm = -1, dd = -1, yy = -1;
      if (s[i] != '-' && s[i + 1] != '-') {
        dd = 10 * (s[i] - '0') + (s[i + 1] - '0');
      }
      if (s[i + 3] != '-' && s[i + 4] != '-') {
        mm = 10 * (s[i + 3] - '0') + (s[i + 4] - '0');
      }
      if (s[i + 6] != '-' && s[i + 7] != '-' && s[i + 8] != '-' &&
          s[i + 9] != '-') {
        yy = 1000 * (s[i + 6] - '0') + 100 * (s[i + 7] - '0') +
             10 * (s[i + 8] - '0') + (s[i + 9] - '0');
      }
      if ((mm != -1) && (dd != -1) && (yy != -1)) {
        if (2013 <= yy && yy <= 2015) {
          if (1 <= mm && mm <= 12) {
            if (1 <= dd && dd <= ndays[mm]) {
              occ[s.substr(i, 10)]++;
            }
          }
        }
      }
    }
    i++, j++;
  }
  int mx = -1;
  string res;
  for (__typeof((occ).begin()) dt = occ.begin(); dt != occ.end(); dt++) {
    if (dt->second > mx) {
      mx = dt->second;
      res = dt->first;
    }
  }
  cout << res << "\n";
  return 0;
}
