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>
#pragma GCC optimize("Ofast")
using namespace std;
const int xx = (int)1e6 + 1;
bool sortinrev(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.first > b.first);
}
long long int A[1000000];
long long int B[1000000];
map<long long int, vector<long long int> > ps;
map<string, long long int> mp;
void fun() {
  mp["01"] = 31;
  mp["02"] = 28;
  mp["03"] = 31;
  mp["04"] = 30;
  mp["05"] = 31;
  mp["06"] = 30;
  mp["07"] = 31;
  mp["08"] = 31;
  mp["09"] = 30;
  mp["10"] = 31;
  mp["11"] = 30;
  mp["12"] = 31;
}
map<string, long long int> cnt;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  fun();
  string s, result;
  cin >> s;
  long long int mx = 0;
  for (long long int i = 0; i <= ((int)(s).size()) - 10; i++) {
    string h = s.substr(i, 10), x = h.substr(6, 4), y = h.substr(3, 2);
    if (h[0] >= '0' && h[1] >= '0' && h[2] == '-' && h[5] == '-' &&
        mp[y] != 0 && (x == "2013" || x == "2014" || x == "2015")) {
      long long int val = (h[0] - '0') * 10;
      val += (h[1] - '0');
      if (val <= mp[y] && val != 0) {
        cnt[h]++;
        if (cnt[h] > mx) result = h, mx = cnt[h];
      }
    }
  }
  cout << result << endl;
  return 0;
}
