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;
const int mod = int(1e9 + 7);
const double PI = acos(-1.0);
int m[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int func(string second) {
  int i, sum = 0;
  for (i = 0; i < second.length(); i++) sum = sum * 10 + (int)second[i] - 48;
  return sum;
}
int ms, k, kk, g, i;
map<string, int> mm;
pair<int, string> a[100000];
vector<string> v;
int main() {
  string second, t;
  getline(cin, second);
  t = "";
  i = 0;
  while (i < second.length()) {
    if (second[i] == '-') {
      v.push_back(t);
      t = "";
    } else
      t += second[i];
    i++;
  }
  if (t != "") v.push_back(t);
  for (i = 0; i < v.size() - 2; i++) {
    if ((v[i].length() > 1) && (v[i + 1].length() == 2) &&
        (v[i + 2].length() > 3)) {
      t = v[i].substr(v[i].length() - 2);
      k = func(t);
      t += "-" + v[i + 1] + "-";
      kk = func(v[i + 1]);
      if ((kk < 13) && (kk > 0) && (k > 0) && (k <= m[kk])) {
        second = v[i + 2].substr(0, 4);
        t += second;
        g = func(second);
        if ((g > 2012) && (g < 2016)) {
          if (mm[t] == 0) {
            mm[t] = ++ms;
            a[ms].second = t;
          }
          a[mm[t]].first++;
        }
      }
    }
  }
  g = 1;
  for (i = 2; i <= ms; i++)
    if (a[i].first > a[g].first) g = i;
  cout << a[g].second;
  return 0;
}
