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;
int n, max1, dd, mm, yy;
string s;
int store[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int cache[50][2050][20];
bool check(int k) {
  for (int i = 0; i < 9; i++) {
    if (i == 2 || i == 5) {
      if (s[k + i] != '-') return false;
    } else {
      if (!(s[k + i] >= '0' && s[k + i] <= '9')) return false;
    }
  }
  return true;
}
int calc(int k) { return (s[k] - '0') * 10 + (s[k + 1] - '0'); }
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> s;
  n = s.size();
  for (int i = 0; i < n - 9; i++) {
    if (check(i)) {
      int date = calc(i);
      int month = calc(i + 3);
      int year = calc(i + 6) * 100 + calc(i + 8);
      if (year >= 2013 && year <= 2015 && month >= 1 && month <= 12 &&
          date >= 1 && date <= store[month]) {
        cache[date][month][year]++;
        if (cache[date][month][year] > max1) {
          max1 = cache[date][month][year];
          dd = date;
          mm = month;
          yy = year;
        }
      }
    }
  }
  printf("%02d-%02d-%04d", dd, mm, yy);
  return 0;
}
