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;
struct Date {
  int d, m, y;
};
bool operator<(Date a, Date b) {
  return make_pair(make_pair(a.d, a.m), a.y) <
         make_pair(make_pair(b.d, b.m), b.y);
}
int days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string s;
bool cor_date(int i) {
  for (int j = 0; j < 10; j++) {
    if ((j == 2) || (j == 5)) {
      if (s[i + j] != '-') return 0;
    } else {
      if (s[i + j] == '-') return 0;
    }
  }
  int y = (((s[i + 6] - '0') * 10 + (s[i + 7] - '0')) * 10 + (s[i + 8] - '0')) *
              10 +
          (s[i + 9] - '0');
  int m = (s[i + 3] - '0') * 10 + (s[i + 4] - '0');
  int d = (s[i + 0] - '0') * 10 + (s[i + 1] - '0');
  if ((y <= 2015) && (y >= 2013) && (m <= 12) && (m >= 1) && (d >= 1) &&
      (d <= days[m - 1])) {
    return 1;
  }
  return 0;
}
Date get_date(int i) {
  int y = (((s[i + 6] - '0') * 10 + (s[i + 7] - '0')) * 10 + (s[i + 8] - '0')) *
              10 +
          (s[i + 9] - '0');
  int m = (s[i + 3] - '0') * 10 + (s[i + 4] - '0');
  int d = (s[i + 0] - '0') * 10 + (s[i + 1] - '0');
  Date D;
  D.y = y;
  D.m = m;
  D.d = d;
  return D;
}
string Dat(Date d) {
  string s;
  s += d.d / 10 + '0';
  s += d.d % 10 + '0';
  s += '-';
  s += d.m / 10 + '0';
  s += d.m % 10 + '0';
  s += '-';
  s += d.y / 1000 + '0';
  d.y %= 1000;
  s += d.y / 100 + '0';
  d.y %= 100;
  s += d.y / 10 + '0';
  d.y %= 10;
  s += d.y + '0';
  return s;
}
map<Date, int> ma;
int main() {
  cin >> s;
  for (int i = 0; i <= (int)s.size() - 10; i++) {
    if (cor_date(i)) {
      ma[get_date(i)]++;
    }
  }
  int mx = 0;
  Date D;
  bool flag = 0;
  for (map<Date, int>::iterator it = ma.begin(); it != ma.end(); it++) {
    if (it->second > mx) {
      mx = it->second;
      D = it->first;
      flag = 0;
    } else {
      if (it->second == mx) {
        flag = 1;
      }
    }
  }
  cout << Dat(D) << endl;
  return 0;
}
