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;
int toInt(string s) {
  int r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
long long toInt64(string s) {
  long long r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
double toDouble(string s) {
  double r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
string toString(long long n) {
  string s, s1;
  while (n / 10 > 0) {
    s += (char)((n % 10) + 48);
    n /= 10;
  }
  s += (char)((n % 10) + 48);
  n /= 10;
  s1 = s;
  for (long long i = 0; i < s.length(); i++) s1[(s.length() - 1) - i] = s[i];
  return s1;
}
bool isUpperCase(char c) { return c >= 'A' && c <= 'Z'; }
bool isLowerCase(char c) { return c >= 'a' && c <= 'z'; }
bool isLetter(char c) { return c >= 'A' && c <= 'Z' || c >= 'a' && c <= 'z'; }
bool isDigit(char c) { return c >= '0' && c <= '9'; }
char toLowerCase(char c) { return (isUpperCase(c)) ? (c + 32) : c; }
char toUpperCase(char c) { return (isLowerCase(c)) ? (c - 32) : c; }
long long Max[50][50][10], maxx = 0;
int months[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
long long A, B, C;
string s, s1;
void chemidunam() {
  if (s[0] == '-') return;
  if (s[1] == '-') return;
  if (s[2] != '-') return;
  if (s[3] == '-') return;
  if (s[4] == '-') return;
  if (s[5] != '-') return;
  if (s[6] != '2') return;
  if (s[7] != '0') return;
  if (s[8] != '1') return;
  if (s[9] != '3' && s[9] != '4' && s[9] != '5') return;
  int jday = (int)(s[0] - '0') * 10 + (s[1] - '0');
  int jmonth = (int)(s[3] - '0') * 10 + (s[4] - '0');
  if (jmonth < 1 || jmonth > 12) return;
  if (jday < 1 || jday > months[jmonth - 1]) return;
  int jyear = s[9] - '0';
  Max[jday][jmonth][jyear]++;
  if (Max[jday][jmonth][jyear] > maxx) {
    A = jday;
    B = jmonth;
    C = jyear;
    maxx = Max[jday][jmonth][jyear];
  };
}
int main() {
  cin >> s1;
  s = "dd-mm-yyyy";
  for (int i = 0; i + s.length() <= s1.size(); i++) {
    for (int j = 0; j < s.length(); j++) s[j] = s1[i + j];
    chemidunam();
  }
  if (A < 10) cout << "0";
  cout << A;
  cout << "-";
  if (B < 10) cout << "0";
  cout << B;
  cout << "-";
  cout << "201" << C << endl;
}
