#include <string>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <iomanip>
#include <ctime>
#include <valarray>
#include <iostream>
#include <sstream>
#include <fstream>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e5 + 10;
int days[2][14] =
{
	{0,31,28,31,30,31,30,31,31,30,31,30,31},
	{0,31,29,31,30,31,30,31,31,30,31,30,31},
};
bool isleap(int y)
{
	if (y % 100 == 0) return y % 400 == 0;
	else return y % 4 == 0;
}
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int y, m, d;
	scanf("%d/%d/%d", &y, &m, &d);
	int cnt = 2;
	while (cnt--)
	{
		int o = isleap(y);
		d++;
		if (d > days[o][m])
		{
			d = 1;
			m++;
			if (m > 12) m = 1, y++;
		}
	}
	printf("%d/%02d/%02d\n", y, m, d);
	return 0;
}