After Fox Ciel won an onsite round of a programming contest, she took a bus to return to her castle. The fee of the bus was 220 yen. She met Rabbit Hanako in the bus. They decided to play the following game because they got bored in the bus.
 -  Initially, there is a pile that contains *x* 100-yen coins and *y* 10-yen coins. -  They take turns alternatively. Ciel takes the first turn. -  In each turn, they must take exactly 220 yen from the pile. In Ciel's turn, if there are multiple ways to take 220 yen, she will choose the way that contains the maximal number of 100-yen coins. In Hanako's turn, if there are multiple ways to take 220 yen, she will choose the way that contains the maximal number of 10-yen coins. -  If Ciel or Hanako can't take exactly 220 yen from the pile, she loses. 
 

Determine the winner of the game.
The first line contains two integers *x* (0 ≤ *x* ≤ 10<sup class="upper-index">6</sup>) and *y* (0 ≤ *y* ≤ 10<sup class="upper-index">6</sup>), separated by a single space.
In the first turn (Ciel's turn), she will choose 2 100-yen coins and 2 10-yen coins. In the second turn (Hanako's turn), she will choose 1 100-yen coin and 12 10-yen coins. In the third turn (Ciel's turn), she can't pay exactly 220 yen, so Ciel will lose.
2 2
Ciel
3 22
Hanako
0 22
Ciel
1000 1000
Ciel
0 0
Hanako
0 21
Hanako
1 11
Hanako
1 12
Ciel
2 1
Hanako
2 23
Ciel
2 24
Hanako
3 1
Hanako
3 2
Ciel
3 13
Ciel
3 14
Hanako
4 1
Hanako
4 2
Ciel
4 25
Hanako
4 26
Ciel
5 1
Hanako
5 2
Ciel
5 15
Hanako
5 16
Ciel
5 23
Ciel
5 24
Hanako
6 1
Hanako
6 2
Ciel
6 13
Ciel
6 14
Hanako
6 23
Ciel
6 24
Hanako
7 1
Hanako
7 2
Ciel
7 13
Ciel
7 14
Hanako
7 25
Hanako
7 26
Ciel
8 1
Hanako
8 2
Ciel
8 15
Hanako
8 16
Ciel
8 25
Hanako
8 26
Ciel
9 1
Hanako
9 2
Ciel
9 15
Hanako
9 16
Ciel
9 23
Ciel
9 24
Hanako
10 12
Ciel
10 13
Ciel
10 22
Ciel
10 23
Ciel
11 12
Ciel
11 13
Ciel
11 24
Hanako
11 25
Hanako
12 14
Hanako
12 15
Hanako
12 24
Hanako
12 25
Hanako
0 1000000
Hanako
1000000 0
Hanako
1000000 1000000
Ciel
178087 42116
Ciel
378897 104123
Ciel
61207 166129
Hanako
743519 228136
Ciel
425829 771644
Ciel
626640 833651
Ciel
308950 895657
Hanako
991262 957664
Ciel
192071 19670
Hanako
874382 81677
Hanako
202081 745873
Hanako
233663 723781
Hanako
783744 701689
Hanako
333825 679597
Hanako
365407 657504
Hanako
915488 635412
Hanako
947070 613320
Hanako
497151 591228
Hanako
528732 87635
Ciel
78813 65543
Hanako
6 4
Hanako
3 5
Ciel
4 24
Hanako
2 14
Ciel
2 26
Hanako
5 26
Ciel
5 5
Hanako
359 479
Hanako
1 20
Ciel
11 0
Hanako
3 0
Hanako
0 30
Ciel
0 35
Ciel
100 99
Ciel
3 4
Ciel
s = input().split()

x = int(s[0]) * 100
y = int(s[1]) * 10
is_odd = False
while (x + y >= 220):
    if is_odd:
        if x - 100 >= 0:
            if (x - 200 >= 0) and (y - 20 >= 0):
                x -= 200
                y -= 20
            else:
                y -= 120
        else:
            y -= 220
    else:
        if y >= 220:
            y -= 220
        elif y >= 120:
            y -= 120
            x -= 100
        else:
            x -= 200
            y -= 20

    is_odd = (not(is_odd))
if (is_odd):
    print("Ciel")
else:
    print("Hanako")