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 SIZE = 1e6;
int str2int(string str) {
  stringstream ss(str);
  int val;
  ss >> val;
  return (val);
}
string int2str(int num) {
  stringstream ss;
  string ans;
  ss << num;
  ans = ss.str();
  return ans;
}
const bool testing = 0;
const int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
void program() {
  string str;
  cin >> str;
  map<string, int> ans;
  for (int i = 0; i < str.length() - 9; i++) {
    string temp = str.substr(i, 10);
    bool bad = 0;
    for (int j = 0; j < 10; j++)
      if (j != 2 && j != 5)
        if (!isdigit(temp[j])) {
          bad = 1;
          break;
        }
    if (bad) continue;
    int d = str2int(temp.substr(0, 2)), m = str2int(temp.substr(3, 2)),
        y = str2int(temp.substr(6, 4));
    char ch1 = temp[2], ch2 = temp[5];
    if (ch1 == '-' && ch2 == '-') {
      if (y > 2012 && y < 2016)
        if (m >= 1 && m <= 12)
          if (d >= 1 && d <= day[m])
            if (ans.find(temp) != ans.end())
              ans[temp]++;
            else
              ans[temp] = 1;
    }
  }
  int max = 0;
  auto mymax = ans.begin();
  for (auto it = ans.begin(); it != ans.end(); it++) {
    if (it->second > max) max = it->second, mymax = it;
  }
  cout << mymax->first;
}
int main() {
  if (!testing) {
    program();
    return 0;
  }
  FILE* fin = NULL;
  fin = fopen("in.txt", "w+");
  fprintf(fin, "15-1--201315-1--201301-01-2013\n");
  fclose(fin);
  freopen("in.txt", "r", stdin);
  printf("test case(1) => expected : \n");
  printf("13-12-2013");
  printf("test case(1) => founded  : \n");
  program();
  return 0;
}
