#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int d[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int t, n;
string s;
map<int, int> red;
void work() {
  int a = 0, idx = 0, res[maxn];
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '-') {
      res[idx++] = a;
      a = 0;
    } else {
      a = a * 10 + (s[i] - '0');
    }
  }
  for (int i = idx; i >= 0; i--) {
    if (res[i] >= 2013) {
      int tmp = res[i];
      while (tmp > 10000) {
        tmp /= 10;
      }
      if (tmp <= 2015) {
        int dd = res[i] * 10000;
        if (res[i - 1] > 0 && res[i - 1] <= 12) {
          dd += res[i - 1] * 100;
          tmp = res[i - 2] % 100;
          if (tmp > 0 && tmp <= d[res[i - 1]]) {
            dd += tmp;
            red[dd]++;
          }
        }
      }
    }
  }
  int amt = 0, ans;
  for (map<int, int>::iterator it = red.begin(); it != red.end(); it++) {
    if (it->second >= amt) {
      amt = it->second;
      ans = it->first;
    }
  }
  for (int i = 0; i < 2; i++) {
    if (ans < 10)
      cout << "0" << ans % 100 << "-";
    else
      cout << ans % 100 << "-";
    ans /= 100;
  }
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> s;
  work();
  return 0;
}
