#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 toInt(int y, int m, int d)
{
	return (y * 100 + m) * 100 + d;
}

string f(int y, int m, int d)
{
	string t = to_string(y);
	string s = "";
	FOR (i, 0, 4 - SZ(t))
		s += '0';
	s += to_string(y);
	s += '-';
	if (m < 10)
		s += '0';
	s += to_string(m);
	s += '-';
	if (d < 10)
		s += '0';
	s += to_string(d);
	return s;
}

int main()
{
	unordered_map<int, string> mp;
	mp.reserve(2e7);
	
	int y1 = 1, m1 = 1, d1 = 1;
	int y2 = 1, m2 = 1, d2 = 0;
	while (y1 < 10000)
	{
		mp[toInt(y1, m1, d1)] = f(y2, m2, d2);
		d1++;
		if (y1 % 4 == 0)
			days[1]++;
		if (d1 > days[m1 - 1])
		{
			d1 -= days[m1 - 1];
			m1++;
		}
		if (y1 % 4 == 0)
			days[1]--;
		if (m1 > 12)
		{
			m1 -= 12;
			y1++;
		}
		
		d2++;
		if (leap(y2))
			days[1]++;
		if (d2 > days[m2 - 1])
		{
			d2 -= days[m2 - 1];
			m2++;
		}
		if (leap(y2))
				days[1]--;
		if (m2 > 12)
		{
			m2 -= 12;
			y2++;
		}	
		
	}
	
	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)), m = stoi(s.substr(5, 2)), d = stoi(s.substr(8, 2));
		cout << mp[toInt(y, m, d)] << '\n';
	}
	cerr << clock() / db(CLOCKS_PER_SEC) << '\n';
	return 0;
}