//prob45: solution
#include <stdio.h>
#include <iostream>
using namespace std;

long long gcd( long long a, long long b ) { return a ? gcd( b % a, a ) : b; }

int main()
{
    int N; cin >> N;
    for( int prob = 1; prob <= N; prob++ )
    {
        char slash;
        long long a, b; cin >> a >> slash >> b;
        long long num = b * b;
        long long den = ( b - a ) * ( b - a );
        long long g = gcd( num, den );
        //printf( "Case #%d: %Ld/%Ld\n", prob, num / g, den / g );
        cout << "Case #" << prob << ": " << num/g << "/" << den/g << endl;
    }
    return 0;
}