#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 10000007;

constexpr int num[2][13] = {
    {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
    {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}
    };

int d[10000][13][32], Y[N], M[N], D[N];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int yy = 1582, mm = 10, dd = 4, tot = 0;
    while (yy <= 9999) {
        int isr = (yy % 4 == 0);
        while (mm <= 12) {
            while (dd <= num[isr][mm]) {
                d[yy][mm][dd] = ++tot;
                ++dd;
            }
            ++mm; dd = 1;
        }
        ++yy; mm = 1;
    }
    yy = 1582, mm = 10, dd = 15, tot = 0;
    while (yy <= 9999) {
        int isr = (yy % 400 == 0) || (yy % 100 != 0 && yy % 4 == 0);
        while (mm <= 12) {
            while (dd <= num[isr][mm]) {
                ++tot;
                Y[tot] = yy;
                M[tot] = mm;
                D[tot] = dd;
                ++dd;
            }
            ++mm; dd = 1;
        }
        ++yy; mm = 1;
    }
    string s;
    while (cin >> s) {
        dd = (s[8] - '0') * 10 + (s[9] - '0');
        mm = (s[5] - '0') * 10 + (s[6] - '0');
        yy = (s[0] - '0') * 1000 + (s[1] - '0') * 100 + (s[2] - '0') * 10 + (s[3] - '0');
        int id = d[yy][mm][dd];
        yy = Y[id];
        mm = M[id];
        dd = D[id];
        printf("%04d-%02d-%02d\n", yy, mm, dd);
    }
    return 0;
}