#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

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

int main() {
	int y, m, d; char c;
	cin >> y >> c >> m >> c >> d;

	int n;
	switch (m) {
	case 4:
	case 6:
	case 9:
	case 11:
		n = 30;
		break;

	case 2:
		n = Is_leap(y) ? 29 : 28;
		break;

	default:
		n = 31;
		break;
	}
	//cout << "n=" << n << endl;

	d += 2;
	m += d / (n + 1);
	d = d == n ? n : d % n;
	y += m / 13;
	m = m == 12 ? 12 : m % 12;
	printf("%d/%02d/%02d\n", y, m, d);
}