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;
map<string, int> mp;
int main() {
  string str, a;
  while (cin >> str) {
    int k = 0, t = 0;
    int sh[100001], maxx = 0, l;
    string ss[100001];
    memset(sh, 0, sizeof(sh));
    for (int i = 0; i < str.length(); i++) {
      int flag = 0;
      a = str.substr(i, 10);
      if (mp[a] == 0) {
        mp[a] = ++t;
        ss[t] = a;
      }
      int u = mp[a];
      sh[u]++;
      int mm = 0, dd = 0, yy = 0;
      for (int j = 0; j < a.length(); j++) {
        if (j == 2 || j == 5) {
          if (a[j] != '-') flag = 1;
        } else if (a[j] < '0' || a[j] > '9')
          flag = 1;
      }
      dd = (a[0] - '0') * 10 + a[1] - '0';
      mm = (a[3] - '0') * 10 + a[4] - '0';
      yy = (a[6] - '0') * 1000 + (a[7] - '0') * 100 + (a[8] - '0') * 10 + a[9] -
           '0';
      if (mm < 1 || mm > 12) flag = 1;
      if (yy < 2013 || yy > 2015) flag = 1;
      if (mm == 1 || mm == 3 || mm == 5 || mm == 7 || mm == 8 || mm == 10 ||
          mm == 12) {
        if (dd <= 0 || dd > 31) flag = 1;
      } else if (mm == 2) {
        if (dd <= 0 || dd > 28) flag = 1;
      } else {
        if (dd <= 0 || dd > 30) flag = 1;
      }
      if (sh[u] > maxx && !flag) {
        maxx = sh[u];
        l = u;
      }
    }
    cout << ss[l] << endl;
  }
  return 0;
}
