#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;cin>>test;while(test--)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;}cout<<endl;
#define vec_debug(v) for(auto it=v.begin();it!=v.end();it++){cerr<<*it<<" ";}cerr<<endl;
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;

int main(){
    int y,m,d;
    scanf("%d/%d/%d",&y,&m,&d);
    vector<int> vec={31,28,31,30,31,30,31,31,30,31,30,31};
    if(m==12&&(d==30||d==31)){
        printf("%d/%d/%d\n",y++,1,d-29);
        return 0;
    }else{
        if(d+2<=vec[(m-1)]){
            d+=2;
        }else if(m!=2){
            d+=2-vec[m-1];
            m++;
        }else{
            d+=2;
            if(y%400==0||(y%4==0&&y%100!=0)){
                if(d==30){
                    d=1;
                    m=3;
                }
            }else{
                d-=vec[m-1];
                m++;
            }
        }
    }
    printf("%04d/%02d/%02d\n",y,m,d);
}