#include <bits/stdc++.h> 

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

VI days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

bool leap(int y)
{
	if (y % 400 == 0)
		return true;
	if (y % 100 == 0)
		return false;
	if (y % 4 == 0)
		return true;
	return false;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	assert(accumulate(ALL(days), 0) == 365);
	string s;
	while (cin >> s)
	{
		int y = stoi(s.substr(0, 4));
		int m = stoi(s.substr(5, 2));
		int d = stoi(s.substr(8, 2));
		
		
		int diff = (y - (m <= 2)) / 100 - (y - (m <= 2)) / 400 - 1;
		if (leap(y))
			days[1]++;
		d += diff;
		if (d > days[m - 1])
		{
			d -= days[m - 1];
			m++;
		}
		if (m > 12)
		{
			m -= 12;
			y++;
		}
		cout << y << '-';
		if (m < 10)
			cout << 0;
		cout << m << '-';
		if (d < 10)
			cout << 0;
		cout << d << '\n';
		if (leap(y))
			days[1]--;
	}
	
	return 0;
}