#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

int length_of_year(int y){ // 1-indexed
    if(y % 400 == 0 || (y % 100 != 0 && y % 4 == 0)){
        return 366;
    }else{
        return 365;
    }
    
}

int length_of_month(int y, int m){ // 1-indexed
    if(m != 2){
        int monthes[12] = {31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        return monthes[m - 1];
    }else if(y % 400 == 0 || (y % 100 != 0 && y % 4 == 0)){
        return 29;
    }else{
        return 28;
    }
    
}

int date_to_int(string date){
    int y = stoi(date.substr(0, 4)), m = stoi(date.substr(5, 2)), d = stoi(date.substr(8, 2));
    int ans = 0;
    for(int i = 1; i < y; i++){
        ans += length_of_year(i);
    }
    for(int i = 1; i < m; i++){
        ans += length_of_month(y, i);
    }
    return ans + d;
}

string int_to_date(int date){
    int y = 1;
    for(int i = 1; length_of_year(i) < date; i++){
        date -= length_of_year(i);
        y = i + 1;
    }
    int m = 1;
    for(int i = 1; length_of_month(y, i) < date; i++){
        date -= length_of_month(y, i);
        m = i + 1;
    }
    string ans;
    ans += string(4 - to_string(y).size(), '0') + to_string(y);
    ans += "/";
    ans += string(2 - to_string(m).size(), '0') + to_string(m);
    ans += "/";
    ans += string(2 - to_string(date).size(), '0') + to_string(date);
    return ans;
}

int main(){
    string s;
    cin >> s;
    cout << int_to_date(date_to_int(s) + 2) << endl;
}