#include <cstdio>

#include <iostream>

#include <cstring>

#include <cmath>

#include <cstdlib>

#include <algorithm>

using namespace std;

typedef long long ll;

const int maxn = ;

ll exgcd(ll a, ll b, ll &x, ll &y)

{

    if (b == )

    {

        x = ;

        y = ;

        return a;

    }

    ll r = exgcd(b, a % b, x, y);

    ll t = x;

    x = y;

    y = t - a / b * y;

    return r;

}

ll china_remainder(int a[], int w[], int n)//w存放除数,a存放余数

{

    ll M = , ans = , x, y;

    for (int i = ; i < n; i++)

        M *= w[i];

    for (int i = ; i < n; i++)

    {

        ll m = M / w[i];

        exgcd(m, w[i], x, y);

        ans = (ans + x * m * a[i]) % M;

    }

    return (ans % M + M) % M;

}

int main()

{

    int T, m, a[maxn], w[maxn];

    w[] = ; w[] = ; w[] = ;

    ll n = ;

    int p, e, i, d, kase = ;

    while (~scanf("%d %d %d %d", &p, &e, &i, &d))

    {

        if (p == - && e == - && i == - && d == -)

            break;

        a[] = p;

        a[] = e;

        a[] = i;

        ll ans = china_remainder(a, w, n);

        ans -= d;

        int mod = w[] * w[] * w[];

        ans = (ans % mod + mod) % mod;

        if (ans == )

            ans = mod;

        printf("Case %d: the next triple peak occurs in %lld days.\n", ++kase, ans);

    }

    return ;

}