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;
map<string, int> cnt;
const int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
void check(string s) {
  if (count(s.begin(), s.end(), '-') != 2) {
    return;
  }
  string ddS, mmS, yyS;
  string cur = "";
  for (char x : s) {
    if (x == '-') {
      if (ddS == "") {
        ddS = cur;
      } else if (mmS == "") {
        mmS = cur;
      } else if (yyS == "") {
        yyS = cur;
      }
      cur = "";
    } else {
      cur += x;
    }
  }
  yyS = cur;
  if (ddS == "" or mmS == "" or yyS == "") return;
  if (yyS[0] == '0') return;
  int dd = stoi(ddS);
  int mm = stoi(mmS);
  int yy = stoi(yyS);
  if (yy >= 2013 and yy <= 2015) {
    if (mm >= 1 and mm <= 12) {
      if (dd > 0) {
        if (dd <= day[mm]) {
          if (ddS.size() == 1) {
            ddS = "0" + ddS;
          }
          if (mmS.size() == 1) {
            mmS = "0" + mmS;
          }
          string built = ddS + "-" + mmS + "-" + yyS;
          cnt[built]++;
        }
      }
    }
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  for (int add = 9; add <= 9; add++) {
    for (int i = 0; i + add < s.size(); i++) {
      string a;
      for (int j = 0; j <= add; j++) {
        a += s[i + j];
      }
      check(a);
    }
  }
  int ma = 0;
  string mas = "?";
  for (auto x : cnt) {
    if (x.second >= ma) {
      ma = x.second;
      mas = x.first;
    }
  }
  cout << mas << '\n';
}
