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 = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
struct Node {
  int d, m, y;
  bool operator<(const Node &rhs) const {
    return d < rhs.d ||
           (d == rhs.d && (m < rhs.m || (m == rhs.m && y < rhs.y)));
  }
};
map<Node, int> cnt;
char s[N];
int n;
void check2(int i) {
  if (i + 9 >= n) return;
  if (!isdigit(s[i])) return;
  if (!isdigit(s[i + 1])) return;
  if (!isdigit(s[i + 3])) return;
  if (!isdigit(s[i + 4])) return;
  if (!isdigit(s[i + 6])) return;
  if (!isdigit(s[i + 7])) return;
  if (!isdigit(s[i + 8])) return;
  if (!isdigit(s[i + 9])) return;
  if (s[i + 2] != '-' || s[i + 5] != '-') return;
  int d = s[i] - '0';
  d = d * 10 + (s[i + 1] - '0');
  int m = s[i + 3] - '0';
  m = m * 10 + (s[i + 4] - '0');
  int y = s[i + 6] - '0';
  y = y * 10 + (s[i + 7] - '0');
  y = y * 10 + (s[i + 8] - '0');
  y = y * 10 + (s[i + 9] - '0');
  if (d < 1 || d > 31) return;
  if (m < 1 || m > 12) return;
  if (d > days[m]) return;
  if (y < 2013 || y > 2015) return;
}
void check(int i) {
  int d = 0, m = 0, y = 0;
  if (i + 2 >= n || s[i + 1] == '-' || s[i + 2] != '-') return;
  d = s[i++] - '0';
  d = d * 10 + (s[i++] - '0');
  if (i + 1 >= n || s[i + 1] == '-') return;
  i++;
  if (i + 2 >= n || s[i + 1] == '-' || s[i + 2] != '-') return;
  m = s[i++] - '0';
  m = m * 10 + (s[i++] - '0');
  if (i + 1 >= n || s[i + 1] == '-') return;
  i++;
  if (i + 3 >= n || s[i + 1] == '-' || s[i + 2] == '-' || s[i + 3] == '-')
    return;
  y = s[i++] - '0';
  y = y * 10 + (s[i++] - '0');
  y = y * 10 + (s[i++] - '0');
  y = y * 10 + (s[i++] - '0');
  if (d < 1 || d > 31) return;
  if (m < 1 || m > 12) return;
  if (d > days[m]) return;
  if (y < 2013 || y > 2015) return;
  cnt[Node{d, m, y}]++;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> s;
  n = strlen(s);
  for (int i = 0; i < n; ++i) {
    if (s[i] != '-') check(i);
  }
  Node ans = {0, 0, 0};
  int mx = 0;
  for (auto p : cnt) {
    if (p.second > mx) {
      mx = p.second;
      ans = p.first;
    }
  }
  if (ans.d < 10) cout << 0;
  cout << ans.d;
  cout << "-";
  if (ans.m < 10) cout << 0;
  cout << ans.m;
  cout << "-";
  cout << ans.y << '\n';
  return 0;
}
