1202 - Bishops

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    long T,r1,c1,r2,c2,c=1;
    scanf("%ld",&T);
    while(T--)
    {
        scanf("%ld%ld%ld%ld",&r1,&c1,&r2,&c2);
        if(abs(r1-r2)==abs(c1-c2))
            printf("Case %ld: 1\n",c++);
        else if(abs(abs(r1-r2)-abs(c1-c2))%2==0)
            printf("Case %ld: 2\n",c++);
        else
            printf("Case %ld: impossible\n",c++);
    }
    return 0;
}