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 main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s, k;
  cin >> s;
  map<string, int> m;
  for (int i = 0; i < s.size() - 9; i++) {
    if (s[i] != '-' && s[i + 1] != '-' && s[i + 2] == '-' && s[i + 3] != '-' &&
        s[i + 4] != '-' && s[i + 5] == '-' && s[i + 6] != '-' &&
        s[i + 7] != '-' && s[i + 8] != '-' && s[i + 9] != '-') {
      if (s[i + 6] == '2' && s[i + 7] == '0' && s[i + 8] == '1' &&
          s[i + 9] >= '3' && s[i + 9] <= '5') {
        if ((s[i + 3] == '0' &&
             (s[i + 4] == '1' || s[i + 4] == '8' || s[i + 4] == '7' ||
              s[i + 4] == '5' || s[i + 4] == '3')) ||
            (s[i + 3] == '1' && (s[i + 4] == '0' || s[i + 4] == '2'))) {
          if ((s[i] == '0' && s[i + 1] > '0') || (s[i] < '3' && s[i] > '0') ||
              (s[i] == '3' && (s[i + 1] == '1' || s[i + 1] == '0'))) {
            k = s[i];
            k += s[i + 1];
            k += s[i + 2];
            k += s[i + 3];
            k += s[i + 4];
            k += s[i + 5];
            k += s[i + 6];
            k += s[i + 7];
            k += s[i + 8];
            k += s[i + 9];
            m[k]++;
          }
        } else if ((s[i + 3] == '0' &&
                    (s[i + 4] == '4' || s[i + 4] == '6' || s[i + 4] == '9')) ||
                   (s[i + 3] == '1' && (s[i + 4] == '1'))) {
          if ((s[i] == '0' && s[i + 1] > '0') || (s[i] < '3' && s[i] > '0') ||
              (s[i] == '3' && (s[i + 1] == '0'))) {
            k = s[i];
            k += s[i + 1];
            k += s[i + 2];
            k += s[i + 3];
            k += s[i + 4];
            k += s[i + 5];
            k += s[i + 6];
            k += s[i + 7];
            k += s[i + 8];
            k += s[i + 9];
            m[k]++;
          }
        } else if (s[i + 3] == '0' && s[i + 4] == '2') {
          if ((s[i] == '0' && s[i + 1] > '0') || (s[i] < '2' && s[i] > '0') ||
              (s[i] == '2' && (s[i + 1] >= '0' && s[i + 1] <= '8'))) {
            k = s[i];
            k += s[i + 1];
            k += s[i + 2];
            k += s[i + 3];
            k += s[i + 4];
            k += s[i + 5];
            k += s[i + 6];
            k += s[i + 7];
            k += s[i + 8];
            k += s[i + 9];
            m[k]++;
          }
        }
      }
    }
  }
  map<string, int>::iterator it = m.begin();
  int maxx = -1;
  for (; it != m.end(); it++) {
    if (maxx < it->second) {
      maxx = it->second;
      s = it->first;
    }
  }
  cout << s;
}
