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 power(long long b, long long e, long long m) {
  if (e == 0) return 1;
  if (e % 2)
    return b * power(b * b % m, (e - 1) / 2, m) % m;
  else
    return power(b * b % m, e / 2, m);
}
long long power(long long b, long long e) {
  if (e == 0) return 1;
  if (e % 2)
    return b * power(b * b, (e - 1) / 2);
  else
    return power(b * b, e / 2);
}
bool id(char c) { return (c >= 48 && c <= 57); }
bool check(string s) {
  bool t = true;
  if (s[2] != '-' || s[5] != '-') t = false;
  if (!t) return t;
  if (!id(s[0]) || !id(s[1]) || !id(s[3]) || !id(s[4]) || !id(s[6]) ||
      !id(s[7]) || !id(s[8]) || !id(s[9]))
    t = false;
  if (!t) return t;
  string dd, mm, yyyy;
  dd = s.substr(0, 2);
  mm = s.substr(3, 2);
  yyyy = s.substr(6, 4);
  int d = stoi(dd);
  int m = stoi(mm);
  int y = stoi(yyyy);
  if (d <= 0) return false;
  if (y < 2013 || y > 2015) t = false;
  if (!t) return t;
  if (m == 2 && d <= 28)
    return true;
  else if (m == 2)
    return false;
  if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
    if (d <= 31)
      return true;
    else
      return false;
  } else {
    if (d <= 30)
      return true;
    else
      return false;
  }
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s, k;
  cin >> s;
  long long l = s.length(), count;
  map<string, long long> m;
  for (auto i = 0; i <= l - 10; i++) {
    k = s.substr(i, 10);
    if (check(k)) m[k]++;
  }
  k = m.begin()->first;
  count = m.begin()->second;
  auto j = m.begin();
  j++;
  while (j != m.end()) {
    if (j->second > count) {
      count = j->second;
      k = j->first;
    }
    j++;
  }
  cout << k;
  return 0;
}
