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 N = int(2e5 + 5);
const int INF = 1e9 + 7;
int d[13] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string s;
vector<int> prefix_function(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; ++i) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
int calc(string x) {
  string t = x + '#' + s;
  vector<int> p = prefix_function(t);
  int res = 0;
  for (int i : p) {
    if (i == x.size()) {
      ++res;
    }
  }
  return res;
}
string get(int a, int b, int c) {
  string res, res1, res2, res3;
  if (c < 10) {
    res += '0';
  }
  while (c) {
    int x = c % 10;
    res1 += char(x + '0');
    c /= 10;
  }
  reverse(res1.begin(), res1.end());
  res += res1;
  res += '-';
  if (b < 10) {
    res += '0';
  }
  while (b) {
    int x = b % 10;
    res2 += char(x + '0');
    b /= 10;
  }
  reverse(res2.begin(), res2.end());
  res += res2;
  res += '-';
  while (a) {
    int x = a % 10;
    res3 += char(x + '0');
    a /= 10;
  }
  reverse(res3.begin(), res3.end());
  res += res3;
  return res;
}
int main() {
  cin >> s;
  string ans;
  int mx = 0;
  for (int i = 2013; i <= 2015; ++i) {
    for (int j = 1; j <= 12; ++j) {
      for (int t = 1; t <= d[j - 1]; ++t) {
        string cur = get(i, j, t);
        if (calc(cur) > mx) {
          mx = calc(cur);
          ans = cur;
        }
      }
    }
  }
  cout << ans;
  return 0;
}
