bishop

#include<bits/stdc++.h>
using namespace std;


int main()
{
    int t,j=0;
    cin>>t;
    while(j<t)
    {

    long long r1,c1,r2,c2,dis;
    cin>>r1>>c1>>r2>>c2;
    dis=abs(r2-r1)+abs(c2-c1);
    if(dis%2!=0)
    {
        printf("Case %d: impossible\n",j+1);
    }
    else
    {
        long long x,y;
        x=r1+c1;
        y=r2+c2;
        if(r1==c1 && r2==c2)
        {
            printf("Case %d: 1\n",j+1);
        }
        else if(x==y)
        {
             printf("Case %d: 1\n",j+1);
        }
        else
        {
           printf("Case %d: 2\n",j+1);
        }
    }
    j++;
    }

    return 0;
}