#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int y,m,d;
string s;

void string_to_day(){
    /*
    yyyy/mm/dd  =>
    y = year;
    m = month;
    d = day;
    */
    y = ((int)s[0] - 48) * 1000 + ((int)s[1] - 48) * 100 + ((int)s[2] - 48) * 10 + ((int)s[3] - 48);
    m = ((int)s[5] - 48) * 10 + ((int)s[6] - 48);
    d = ((int)s[8] - 48) * 10 + ((int)s[9] - 48);
}

void tomorrow(){
    d++;
    int last_day = 31;
    if(m == 2){
        last_day = 28;
        if(y % 4 == 0)last_day = 29;
        if(y % 100 == 0)last_day = 28;
        if(y % 400 == 0)last_day = 29;
    }else if(m == 4 || m == 6 || m == 9 || m == 11){
        last_day = 30;
    }
    if(d > last_day){
        m++;
        d = 1;
        if(m > 12){
            y++;
            m = 1;
        }
    }
}

void print_day(){
    cout << setfill('0') << right << setw(4) << y;
    cout << '/';
    cout << setfill('0') << right << setw(2) << m;
    cout << '/';
    cout << setfill('0') << right << setw(2) << d;
    cout << endl;
}

int main() {
    cin >> s;
    string_to_day();

    tomorrow();
    tomorrow();

    print_day();

    return 0;
}
 
 
// 経過日数計算
int nissuu(int y, int m, int d){
    if(m == 1 || m == 2){
        m += 12;
        y--;
    }
    return 365 * y + y / 4 - y / 100 + y / 400 + 306 * (m + 1) / 10 + d - 429;
}