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 toNum(string s) {
  int ans = 0;
  for (int i = 0; i < s.size(); i++)
    if (s[i] >= '0' && s[i] <= '9') {
      ans = ans * 10 + (s[i] - '0');
    } else
      return -1;
  return ans;
}
bool check(string s) {
  if (s[2] != '-' || s[5] != '-') return 0;
  string ngay = s.substr(0, 2);
  int Ngay = toNum(ngay);
  if (Ngay < 1 || Ngay > 31) return 0;
  string thang = s.substr(3, 2);
  int Thang = toNum(thang);
  if (Thang < 1 || Thang > 12) return 0;
  string nam = s.substr(6, 4);
  int Nam = toNum(nam);
  if (Nam < 2013 || Nam > 2015) return 0;
  if (Thang == 4 || Thang == 6 || Thang == 9 || Thang == 11)
    if (Ngay > 30) return 0;
  if (Thang == 2 && Ngay > 28) return 0;
  return 1;
}
string s;
map<string, int> m;
map<string, int>::iterator it;
int main() {
  cin >> s;
  for (int i = 0; i < s.size() - 9; i++)
    if (s[i] != '-') {
      string tmp = s.substr(i, 10);
      if (check(tmp)) m[tmp]++;
    }
  string ans = "1";
  m[ans] = 0;
  for (it = m.begin(); it != m.end(); it++) {
    if (it->second > m[ans]) ans = it->first;
  }
  cout << ans << endl;
  return 0;
}
