//中国剩余问题
#include<iostream>
#include<cstdio>
#include<cmath>
#define N 21252
#define k1 23
#define k2 28
#define k3 33
using namespace std;
int main(void){
int p,e,i,d,cnt=1;
int a0,S;
while(1){
scanf("%d%d%d%d",&p,&e,&i,&d);
if(p==-1)break;
S=0;
for(a0=1;a0*k2*k3%k1!=p%k1;a0++);
S+=a0*k2*k3;
for(a0=0;a0*k1*k3%k2!=e%k2;a0++);
S+=a0*k1*k3;
for(a0=0;a0*k2*k1%k3!=i%k3;a0++);
S+=a0*k2*k1;
S=S%N-d;
if(S<=0)S+=N;
printf("Case %d: the next triple peak occurs in %d days.\n",cnt,S);
cnt++;
}
return 0;
}