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;
long long G(long long a, long long b) {
  if (b == 0) return a;
  return G(b, a % b);
}
map<string, int> m;
map<string, bool> mark;
vector<string> v;
vector<pair<int, string> > q;
int day[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  for (int i = 0; i < s.length() - 9; i++) {
    string ss = s.substr(i, 10);
    if (!mark[ss]) v.push_back(ss);
    mark[ss] = 1;
    m[ss]++;
  }
  for (int i = 0; i < v.size(); i++) q.push_back(make_pair(m[v[i]], v[i]));
  sort(q.begin(), q.end());
  reverse(q.begin(), q.end());
  for (int i = 0; i < q.size(); i++) {
    string s = q[i].second;
    if (s[2] != '-' || s[5] != '-') continue;
    s[2] = s[5] = '0';
    bool b = 0;
    for (int j = 0; j < s.length(); j++)
      if (s[j] == '-') b = 1;
    if (b) continue;
    s[2] = s[5] = '-';
    int da, mo, ye;
    da = 10 * s[0] + s[1] - 11 * '0';
    mo = 10 * s[3] + s[4] - 11 * '0';
    ye = 1000 * s[6] + 100 * s[7] + 10 * s[8] + s[9] - 1111 * '0';
    if (ye < 2013 || ye > 2015) continue;
    if (mo < 1 || mo > 12) continue;
    if (da < 1 || da > day[mo]) continue;
    cout << s << endl;
    break;
  }
}
