#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    auto f = [](int y) {
        if(y % 4 != 0) return false;
        if(y % 400 == 0) return true;
        if(y % 100 == 0) return false;
        return true;
    };

    int nd[] = {-int(1e9), 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    using T = tuple<int,int,int>;
    vector< T > a;
    for(int y = 2000; y <= 2401; y++) {
        for(int m = 1; m <= 12; m++) {
            for(int d = 1; d <= nd[m]; d++) {
                a.push_back(T{y, m, d});
            }
        }
        if(f(y)) a.push_back(T{y, 2, 29});
    }

    sort(a.begin(), a.end());
    int y,m,d; char c; cin >> y >> c >> m >> c >> d;
    T now = {y, m, d};
    for(int i = 0; i < int(a.size()); i++) {
        if(a[i] == now) {
            auto [y, m, d] = a[i + 2];
            printf("%04d/%02d/%02d\n", y, m, d);
            return 0;
        }
    }
}