Description

Spring is coming, too.(Why do I say too?)

SDNU is a school what has a gender imbalance. There are some beautiful girls in the SDNU ACM-ICPC Association but HuaHua(HH) and ChaoChao(CC) love a little fat girls. Fortunately, there is a girl named Virgo. HH and CC love her and even fight for her. And then one day, virgo comes up a solution about this problem.

Virgo stands at the end of a queue. The queue contains $N$ people. Let HH and CC start from the head of the queue, and each one every time only can choose to take away 1-4 people. When someone can take Vrigo, Vrigo will give him a very beautiful night.

(HH take away people at first and everyone will choose the most beneficial strategy for himself.)

Format

Input

The first line is a number $N(N \leq 500)$, represents $N$ test case.

Then followed $N$ lines,each line have a number($\leq 2^{1000}$) mesns the number of the queue.

Output

Tell us who will have a beautiful night.(“huahua” or “chaochao”)

Samples

3
2
3
6

huahua
huahua
huahua