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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  getline(cin >> ws, s);
  vector<string> a;
  string b = "";
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '-') {
      a.push_back(b);
      b = "";
    } else {
      b += s[i];
    }
  }
  a.push_back(b);
  map<string, int> cnt;
  int condition;
  if (a.size() > 2) {
    condition = a.size();
  } else if (a.size() == 2) {
    condition = 3;
  }
  for (int i = 2; i < condition; i++) {
    if (a[i].size() >= 4) {
      string year = "";
      year += a[i][0];
      year += a[i][1];
      year += a[i][2];
      year += a[i][3];
      if (stoi(year) >= 2013 && stoi(year) <= 2015) {
        if (a[i - 1].size() == 2) {
          string month = "";
          month = a[i - 1];
          if (stoi(month) >= 1 && stoi(month) <= 12) {
            if (a[i - 2].size() >= 2) {
              string day = "";
              day += a[i - 2][a[i - 2].size() - 2];
              day += a[i - 2][a[i - 2].size() - 1];
              if (stoi(month) <= 7) {
                if (stoi(month) % 2) {
                  if (stoi(day) <= 31 && stoi(day) > 0) {
                    string ans = "";
                    ans += day + '-' + month + '-' + year;
                    cnt[ans]++;
                  } else {
                    continue;
                  }
                } else {
                  if (stoi(month) == 2) {
                    if (stoi(day) <= 28 && stoi(day) > 0) {
                      string ans = "";
                      ans += day + '-' + month + '-' + year;
                      cnt[ans]++;
                    } else {
                      continue;
                    }
                  } else {
                    if (stoi(day) <= 30 && stoi(day) > 0) {
                      string ans = "";
                      ans += day + '-' + month + '-' + year;
                      cnt[ans]++;
                    } else {
                      continue;
                    }
                  }
                }
              } else {
                if (stoi(month) % 2) {
                  if (stoi(day) <= 30 && stoi(day) > 0) {
                    string ans = "";
                    ans += day + '-' + month + '-' + year;
                    cnt[ans]++;
                  } else {
                    continue;
                  }
                } else {
                  if (stoi(day) <= 31 && stoi(day) > 0) {
                    string ans = "";
                    ans += day + '-' + month + '-' + year;
                    cnt[ans]++;
                  } else {
                    continue;
                  }
                }
              }
            }
          }
        }
      }
    }
  }
  int ans = 0;
  string an;
  for (auto it = cnt.begin(); it != cnt.end(); it++) {
    if (it->second > ans) {
      ans = it->second;
      an = it->first;
    }
  }
  cout << an << "\n";
}
