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;
template <class T, class L>
bool smax(T &x, L y) {
  return x < y ? (x = y, 1) : 0;
}
template <class T, class L>
bool smin(T &x, L y) {
  return y < x ? (x = y, 1) : 0;
}
const int maxn = 1e5 + 17;
char s[maxn];
int n, mx[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
map<string, int> mp;
void check(char *s) {
  for (int i = 0; i < 10; i++)
    if ((i == 2 || i == 5) ^ (s[i] == '-')) return;
  string y(s + 6, s + 10);
  if (y != "2013" && y != "2014" && y != "2015") return;
  int m = (s[3] - '0') * 10 + (s[4] - '0');
  if (m < 1 || 12 < m) return;
  int d = (s[0] - '0') * 10 + (s[1] - '0');
  if (d < 1 || d > mx[m]) return;
  mp[string(s, s + 10)]++;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  scanf("%s", s), n = strlen(s);
  for (int i = 0; i <= n - 10; i++) check(s + i);
  int mx = 0;
  for (auto &x : mp) smax(mx, x.second);
  for (auto &x : mp)
    if (x.second == mx) cout << x.first << '\n';
  return 0;
}
