#include<cmath>
#include<algorithm>
using namespace std;
int x,y,dd;
void ext_gcd(int a,int b)
{
if(b==0)
{
x=1;
y=0;
dd=a;
}
else
{
ext_gcd(b,a%b);
int t=x;
x=y;
y=t-a/b*y;
}
}
int main()
{
int a[5],m[5],M,cnt=1,d;
m[0]=23,m[1]=28,m[2]=33;
while(scanf("%d%d%d%d",&a[0],&a[1],&a[2],&d)==4)
{
if(a[0]==-1&&a[1]==-1&&a[2]==-1&&d==-1)
break;
int j;
M=1;
for(j=0;j<3;j++)
M*=m[j];
int ans=0;
for(j=0;j<3;j++)
{
int t=M/m[j];
ext_gcd(t,m[j]);
ans=(ans+t*x*a[j])%M;
}
while(ans<=d)
{
ans+=M;
}
printf("Case %d: the next triple peak occurs in %d days.\n",cnt++,ans-d);
}
return 0;
}