{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eAshishgup and FastestFinger play a game. \u003c/p\u003e\u003cp\u003eThey start with a number $$$n$$$ and play in turns. In each turn, a player can make \u003cspan class\u003d\"tex-font-style-bf\"\u003eany one\u003c/span\u003e of the following moves:\u003c/p\u003e\u003cul\u003e \u003cli\u003e Divide $$$n$$$ by any of its odd divisors greater than $$$1$$$. \u003c/li\u003e\u003cli\u003e Subtract $$$1$$$ from $$$n$$$ if $$$n$$$ is greater than $$$1$$$. \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eDivisors of a number include the number itself.\u003c/p\u003e\u003cp\u003eThe player who is \u003cspan class\u003d\"tex-font-style-bf\"\u003eunable to make a move\u003c/span\u003e loses the game.\u003c/p\u003e\u003cp\u003eAshishgup moves first. Determine the winner of the game if both of them play optimally.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$t$$$ ($$$1 \\leq t \\leq 100$$$) \u0026nbsp;— the number of test cases. The description of the test cases follows.\u003c/p\u003e\u003cp\u003eThe only line of each test case contains a single integer \u0026nbsp;— $$$n$$$ ($$$1 \\leq n \\leq 10^9$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAshishgup\u003c/span\u003e\" if he wins, and \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eFastestFinger\u003c/span\u003e\" otherwise (without quotes).\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e7\n1\n2\n3\n4\n5\n6\n12\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eFastestFinger\nAshishgup\nAshishgup\nFastestFinger\nAshishgup\nFastestFinger\nAshishgup\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, $$$n \u003d 1$$$, Ashishgup cannot make a move. He loses.\u003c/p\u003e\u003cp\u003eIn the second test case, $$$n \u003d 2$$$, Ashishgup subtracts $$$1$$$ on the first move. Now $$$n \u003d 1$$$, FastestFinger cannot make a move, so he loses.\u003c/p\u003e\u003cp\u003eIn the third test case, $$$n \u003d 3$$$, Ashishgup divides by $$$3$$$ on the first move. Now $$$n \u003d 1$$$, FastestFinger cannot make a move, so he loses.\u003c/p\u003e\u003cp\u003eIn the last test case, $$$n \u003d 12$$$, Ashishgup divides it by $$$3$$$. Now $$$n \u003d 4$$$, FastestFinger is forced to subtract $$$1$$$, and Ashishgup gets $$$3$$$, so he wins by dividing it by $$$3$$$.\u003c/p\u003e"}}]}