#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

int n;

unsigned x, y, z;

unsigned int tang()

{

    unsigned int t;

    x ^= x << ;

    x ^= x >> ;

    x ^= x << ;

    t = x;

    x = y;

    y = z;

    z = t ^ x ^ y;

    return z;

}

ull gcd(ull x, ull y)

{

    if(y == ) return x;

    return gcd(y, x % y);

}

ull q[];

int main()

{

    int T;

    scanf("%d", &T);

    int cas = ;

    while(T--)

    {

        cas++;

        cin>>n>>x>>y>>z;

        for(int i = ; i < n; i++) q[i] = tang();

        int len = min(, n);

        nth_element(q, q + len, q + n, greater<ull>());

        ull ans = ;

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

        {

            for(int j = i + ; j < len; j++)

            {

                ull tmp = gcd(q[i], q[j]);

                ans = max(ans, q[i] / tmp * q[j]);

            }

        }

        printf("Case #%d: %llu\n", cas, ans);

    }

    return ;

}