#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <bitset>
#include <functional>
using namespace std;
const constexpr int INF = 1e9;

long long N;
int y, m, d;
string s;
int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

void solve(){
    if((y % 4 == 0) ^ (y % 100 == 0) ^ (y % 400 == 0)) days[2]=29;
    
    d+=2;
    if(days[m]<d){
        d-=days[m];
        m++;
        if(m>12){
            y++;
            m=1;
        }
    }
    printf("%04d/%02d/%02d\n", y, m, d);
}
int main() {
    scanf("%d/%d/%d", &y, &m, &d);
    solve();
	return 0;
}