grab-the-laddu

On the eve of New Year in Dholakpur, Chota Bheem and Chutki are playing a game, described as follows. 

There are two plates full of Laddus. Both can eat 'L' (L ≥ 1) laddus from any one plate or 'L' laddus from both the plates in each step. They play the game alternatively and the last one to eat the laddu will be the winner.

As Chota Bheem wants to impress Chutki, he wants to make Chutki the winner. You have to help Chota Bheem in deciding who should play first.

Input:

The first line of input contains an integer T denoting the number of test cases.

Each line of test case contains 2 numbers 'a' and 'b', the number of laddus in each plate respectively.

Output:

For each test case, output a single word "Bheem" or "Chutki" denoting the player who should play first.

Constraints:

1 ≤ T ≤ 100000

0 ≤ a,b ≤ 1000000

SAMPLE INPUT
3
1 2
1 3
2 0

SAMPLE OUTPUT
Bheem
Chutki
Chutki

Explanation

In test case 1, from (1,2) we can reach (1,1) or (0,1) or (0,2) which are all winnning cases so Bheem plays first.

Source: hackerearth | Difficulty: MEDIUM


Solutions: