All submissions for this problem are available.
Your little friend, Shinchan is playing video games with his little sister, Himawari during his holidays. The video game is about their Superhero, Action Kamen. According to the game, in each trail, Shinchan will have some power of Action Beam S and Himawari will have some power of Action Beam H. In each trial, the winner is one with greater power of Action Beam.If the power of Action Beam of Shinchan and Himawari is same, Shinchan considers his little sister, Himawari the winner, since he has a soft corner for his little sister.
Can you figure out who is the winner, given the power of Action Beams of Shinchan and Himawari.
- The first line contains a single integer T denoting the number of test cases. Then, T test cases follow.
- The one and only line of each test case, contains two space-separated integers S and H.
For each test case output a single line containing the winner of each trial, “Shinchan”(without quotes) or “Himawari”(without quotes).
- 1 ≤ T ≤ 106
- 0 ≤ S, H ≤ 105
Input 3 2 9 5 5 8 4 Output Himawari Himawari Shinchan
|Tags||aparup_ghosh, condition, encoding, horsbug98, horsbug98, implementation|
|Time Limit:||2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.