//剩余定理
#include <iostream>

using namespace std;

int main(void)
{
	int p,e,i,d;
	bool found = false;
	int m;
	m = 1;

	while(cin>>p>>e>>i>>d && p != -1)
	{

		int j = 1;
		int day;
		while(true)
		{
			day = 23 * j + p;
			if((day - e)%28 == 0)
			{
				int gridpe = 23 * 28;

				while(true)
				{
					if((day - i)%33 == 0)
					{
						cout<<"Case "<<m<<": the next triple peak occurs in "<<(day - d > 21252 ? day-d - 21252:day - d)<<" days."<<endl;
						found = true;
						break;
					}
					day += gridpe;
				}

			}

			if(found == true)
			{
				found = false;
				break;
			}
			j++;
		}
		m ++;

	}
	return 0;
}