2013暑假集训B组训练赛第二场

A - Bus Game

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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.

Input

The first line contains two integers x (0 ≤ x ≤ 10⁶) and y (0 ≤ y ≤ 10⁶), separated by a single space.

Output

If Ciel wins, print "Ciel". Otherwise, print "Hanako".

Sample Input

Input

2 2

Output

Ciel

Input

3 22

Output

Hanako



很简单的循环，判断

#include <cstdio>

int x, y;

int main()
{
    while(~scanf("%d%d",&x,&y))
    {
        while(x >= 0&& y>=0)
        {
            if(x>=2 && y >= 2)
            {
                x -= 2;
                y -= 2;
            }
            else if(x==1 && y >= 12)
            {
                x -= 1;
                y -= 12;
            }
            else if(x== 0 && y>=22)
            {
                y -= 22;
            }
            else
            {
                puts("Ciel");
                break;

            }


            if(y>=22)
            {
                y -= 22;
            }
            else if(y>=12 && x >=1)
            {
                x -= 1;
                y -= 12;
            }
            else if(x>= 2 && y >=2)
            {
                x -= 2;
                y -= 2;
            }
            else
            {
                puts("Hanako");
                break;

            }
        }
    }

}