Problem Description
n pagodas were standing erect in Hong Jue Si between the Niushou Mountain andthe Yuntai Mountain, labelled from1to n. However, only twoof them (labelled aand b, where 1≤a≠b≤n) withstood the test oftime.
Two monks, Yuwgna and Iaka, decide to make glories great again. They take turns to build pagodas and Yuwgna takes first. For each turn, one can rebuild anew pagodas labelled i (i∉{a,b} and1≤i≤n) if there exist two pagodas standing erect, labelled j and k respectively, such that i=j+k or i=j−k. Each pagoda can not be rebuilt twice.
This is a game for them. The monk who can not rebuild anew pagoda will lose the game.
Input
The firstlinecontainsaninteger t (1≤t≤500) which is thenumberof test cases.
For each test case, thefirstline provides the positive integer n (2≤n≤20000) andtwo different integers aand b.
Output
For each test case, output the winner (``Yuwgna" or ``Iaka"). Both of them will make the best possible decision eachtime.
Sample Input
16212313671210012868968106811681268136814681568166813146819941131994712
Sample Output
Case #1: Iaka
Case #2: Yuwgna
Case #3: Yuwgna
Case #4: Iaka
Case #5: Iaka
Case #6: Iaka
Case #7: Yuwgna
Case #8: Yuwgna
Case #9: Iaka
Case #10: Iaka
Case #11: Yuwgna
Case #12: Yuwgna
Case #13: Iaka
Case #14: Yuwgna
Case #15: Iaka
Case #16: Iaka