Problem Description
Alice is playing a game with JSL. (...where is Bob?)
Alice picks a number x from segment [l1,r1]. After saw this number, JSL picks a number y from segment [l2,r2].(x and y may have same value). Finally, they compute z=x⊕y (⊕ is exclusive or). Alice wants z to be as maximal as possible while JSL wants z to be as minimal as possible. Alice and JSL are both clever enough, and what's the final value of z?
Input
Multiple test cases. In the first line there is an integer T, indicating the number of test cases.
For each test cases, there are four integers l1,r1,l2,r2 .
1≤T≤10000,0≤l1≤r1≤109,0≤l2≤r2≤109
Output
For each test case, output one line. The output format is Case #x: ans, x is the case number,starting from 1. ans is the value of z.
Sample Input
2
1 4 3 8
1 3 4 7
Sample Output
Case #1: 2
Case #2: 4