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 inf = 1000 * 1000 * 1000;
const int maxn = 1000;
int c, mx, mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string mxs, s, ans[1001];
map<string, int> u;
bool find(string x) {
  for (int i = 0; i < x.size(); i++) {
    if (x[i] == '-' && i != 2 && i != 5) return false;
    if (i == 2 || i == 5) {
      if (x[i] != '-') return false;
    }
  }
  int dd;
  dd = (x[0] - 48) * 10 + (x[1] - 48);
  int mm;
  mm = (x[3] - 48) * 10 + (x[4] - 48);
  int yy;
  yy = (x[6] - 48) * 1000 + (x[7] - 48) * 100 + (x[8] - 48) * 10 + (x[9] - 48);
  if (yy < 2013 || yy > 2015) return false;
  if (dd > mon[mm] || dd <= 0) return false;
  return true;
}
int main() {
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    string st = "";
    for (int j = i; j < i + 10; j++) {
      st += s[j];
    }
    if (find(st)) {
      if (u[st] == 0) ans[++c] = st;
      u[st]++;
    }
  }
  for (int i = 1; i <= c; i++) {
    if (u[ans[i]] > mx) {
      mx = u[ans[i]];
      mxs = ans[i];
    }
  }
  cout << mxs;
  return 0;
}
