#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

vector<string> split(const string &s, const string &delimiter) {
  vector<string> res;
  int pos = 0;
  while (true) {
    int del_pos = s.find(delimiter, pos);
    if (del_pos == s.npos) break;
    res.emplace_back(s.substr(pos, del_pos - pos));
    pos = del_pos + delimiter.length();
  }
  res.emplace_back(s.substr(pos));
  return res;
}

int main() {
  string s; cin >> s;
  vector<string> ymd = split(s, "/");
  int y = stoi(ymd[0]), m = stoi(ymd[1]), d = stoi(ymd[2]) + 2;
  vector<int> day{31, y % 4 == 0 && y != 2100 && y != 2200 && y != 2300 ? 29 : 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
  if (d > day[m - 1]) {
    d -= day[m - 1];
    ++m;
  }
  if (m >= 13) {
    m -= 12;
    ++y;
  }
  cout << y << (m < 10 ? "/0" : "/") << m << (d < 10 ? "/0" : "/") << d << '\n';
  return 0;
}