#include "bits/stdc++.h" #define REP(i, n, N) for(ll i=(n); i<(N); i++) #define RREP(i, n, N) for(ll i=(N-1); i>=n; i--) #define CK(n, a, b) ((a)<=(n)&&(n)<(b)) #define ALL(v) (v).begin(),(v).end() #define MCP(a, b) memcpy(b,a,sizeof(b)) #define p(s) cout<<(s)<> typedef long long ll; using namespace std; const ll mod = 1e9 + 7; const ll inf = 1e18; int days[] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; string S; int Y, M, D; int main() { scanf("%d/%d/%d", &Y, &M, &D); if (Y % 4 == 0 && !(Y % 100 == 0 && Y % 400 != 0)) days[2] = 29; D += 2; if (days[M] < D) { D -= days[M]; M++; if (12 < M) { Y++; M = 1; } } printf("%04d/%02d/%02d\n", Y, M, D); return 0; }