#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

bool is_uruu(int y) {
  return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}

int t[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int main() {
  int y, m, d;
  scanf("%d/%d/%d", &y, &m, &d);
  if(is_uruu(y)) ++t[1];
  for(int i = 0; i < 2; i++) {
    d++;
    if(t[m - 1] < d) {
      d = 1;
      ++m;
    }
    if(m == 13) {
      m = 1;
      ++y;
    }
  }
  printf("%d/%02d/%02d", y, m, d);
}