poj 2495 Incomplete chess boards

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int main(){int t;    scanf("%d", &t);    for (int i =0; i < t; i++)    {        printf("Scenario #%d:n", i +1);        int a, b, c, d;        scanf("%d%d%d%d", &a, &b, &c, &d);        if (((a + b) &1) == ((d + c) &1)) printf("0n");        else printf("1n");        putchar('n');    }    return 0;}