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>
const int mod = ((1E9) + 7);
const int intmax = ((1E9) + 7);
using namespace std;
string s[1120];
int lps[15];
int count_[1120];
void cal_lcp(string &p) {
  int j = -1;
  int i = 0;
  lps[0] = -1;
  while (i < p.size()) {
    while (j >= 0 && p[i] != p[j]) j = lps[j];
    i++;
    j++;
    lps[i] = j;
  }
}
void kmp(string &t, string &p, int x) {
  int i = 0, j = 0;
  while (i < t.size()) {
    while (j >= 0 && t[i] != p[j]) j = lps[j];
    i++;
    j++;
    if (j == p.size()) count_[x]++;
  }
}
string to_string_(int a) {
  stringstream ss;
  ss << a;
  string t;
  ss >> t;
  return t;
}
int main() {
  ios::sync_with_stdio(0);
  int test, a, b, c;
  int n, m;
  int max_ = 0, pos = -1;
  string text;
  cin >> text;
  int x = 0;
  for (int i = 1; i <= 31; i++)
    for (int j = 1; j <= 12; j++)
      for (int k = 2013; k <= 2015; k++) {
        if (j == 2 && i > 28) break;
        if (j <= 7 && j % 2 == 0 && i == 31) break;
        if (j > 7 && j % 2 != 0 && i == 31) break;
        if (i < 10) s[x] += '0';
        s[x] += to_string_(i);
        s[x] += '-';
        if (j < 10) s[x] += '0';
        s[x] += to_string_(j);
        s[x] += '-';
        s[x] += to_string_(k);
        x++;
      }
  for (int i = 0; i < x; i++) {
    cal_lcp(s[i]);
    kmp(text, s[i], i);
    if (count_[i] > max_) {
      pos = i;
      max_ = count_[i];
    }
  }
  cout << s[pos];
  return 0;
}
