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;
double pi = 3.1415926536;
const int oo = (int)1e9;
const long long OO = numeric_limits<long long>::max();
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int di[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dj[] = {1, -1, 0, 0, 1, -1, -1, 1};
int f1[] = {0, 0, 0, 1, 1, 1, -1, -1, -1};
int f2[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string toString(int x) {
  stringstream ss;
  string s;
  ss << x;
  ss >> s;
  return s;
}
int main() {
  ios_base::sync_with_stdio(false);
  map<string, int> mymap;
  vector<string> myDates;
  for (int i = 2013; i <= 2015; i++) {
    for (int j = 1; j <= 12; j++) {
      for (int k = 1; k <= days[j]; k++) {
        stringstream ss;
        string year, month, day;
        day = toString(k);
        if (((int)(day).size()) == 1) day = "0" + day;
        month = toString(j);
        if (((int)(month).size()) == 1) month = "0" + month;
        year = toString(i);
        string date = day + month + year;
        myDates.push_back(date);
      }
    }
  }
  string s;
  cin >> s;
  for (int i = 0; i < ((int)(s).size()); i++) {
    string str = s.substr(i, 10);
    int cnt = 0;
    string date;
    for (int j = 0; j < ((int)(str).size()); j++) {
      if (str[j] == '-')
        cnt++;
      else
        date += str[j];
    }
    if (cnt == 2) {
      mymap[date]++;
    }
  }
  int idx = -1, mx = -1;
  for (int i = 0; i < ((int)(myDates).size()); i++) {
    int take = mymap[myDates[i]];
    if (take >= mx) {
      idx = i;
      mx = take;
    }
  }
  string ans = myDates[idx];
  for (int i = 0; i < ((int)(ans).size()); i++) {
    cout << ans[i];
    if (i == 1) {
      cout << "-";
    }
    if (i == 3) {
      cout << "-";
    }
  }
}
