Ashishgup and FastestFinger play a game. 

They start with a number n and play in turns. In each turn, a player can make any one of the following moves:

  * Divide n by any of its odd divisors greater than 1. 
  * Subtract 1 from n if n is greater than 1. 



Divisors of a number include the number itself.

The player who is unable to make a move loses the game.

Ashishgup moves first. Determine the winner of the game if both of them play optimally.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The only line of each test case contains a single integer — n (1 ≤ n ≤ 10^9).

Output

For each test case, print "Ashishgup" if he wins, and "FastestFinger" otherwise (without quotes).

Example

Input


7
1
2
3
4
5
6
12


Output


FastestFinger
Ashishgup
Ashishgup
FastestFinger
Ashishgup
FastestFinger
Ashishgup

Note

In the first test case, n = 1, Ashishgup cannot make a move. He loses.

In the second test case, n = 2, Ashishgup subtracts 1 on the first move. Now n = 1, FastestFinger cannot make a move, so he loses.

In the third test case, n = 3, Ashishgup divides by 3 on the first move. Now n = 1, FastestFinger cannot make a move, so he loses.

In the last test case, n = 12, Ashishgup divides it by 3. Now n = 4, FastestFinger is forced to subtract 1, and Ashishgup gets 3, so he wins by dividing it by 3.
// package cp;
import java.io.*;
import java.util.*;
public class Cf_three {
	static long cnt_odd=0;
	static long cnt_eve=0;
	 static void printDivisors(int n) 
	    { 
		 	
	        // Note that this loop runs till square root 
	        for (int i=2; i<=Math.sqrt(n); i++) 
	        { 
	        	if(n%i==0) {
	        		if(i==n/i) {
	        			if(i%2==1)cnt_odd++;
	        			else cnt_eve++;
	        		}
	        		else {
	        			if(i%2==1)cnt_odd++;
	        			else cnt_eve++;
	        			if((n/i)%2==1)cnt_odd++;
	        			else cnt_eve++;
	        		}
//	        		System.out.println(i+" "+(n/i));
	        	}
//	            if (n%i==0 && i%2==1) cnt_odd++;
//	            if(n%i==0 && i%2==0)cnt_eve++;
//	            { 
//	                // If divisors are equal, print only one 
//	                if (n/i == i) 
//	                    System.out.printf("%d ", i); 
//	       
//	                else // Otherwise print both 
//	                    System.out.printf("%d %d ", i, n/i); 
//	            }
	        }
	        
	    } 
	public static void main(String[] args) throws IOException {	
		PrintWriter out = new PrintWriter(System.out);
		Readers.init(System.in);
		int t=Readers.nextInt();
		Cf_three obj=new Cf_three();
		for (int i = 0; i < t; i++) {
			int n=Readers.nextInt();
			if(n==1)System.out.println("FastestFinger");
			else if(n==2)System.out.println("Ashishgup");
			else if(n%2==1)System.out.println("Ashishgup");
			else {
				obj.printDivisors(n);
				if(cnt_odd==0)System.out.println("FastestFinger");
				else if(cnt_odd+cnt_eve==2)System.out.println("FastestFinger");
				else System.out.println("Ashishgup");
			}
			
			cnt_eve=0;
			cnt_odd=0;
		}
		out.flush();
	}

}
class Readers {

    static BufferedReader reader;

    static StringTokenizer tokenizer;



    /** call this method to initialize reader for InputStream */

    static void init(InputStream input) {

        reader = new BufferedReader(

                     new InputStreamReader(input) );

        tokenizer = new StringTokenizer("");

    }



    /** get next word */

    static String next() throws IOException {

        while ( ! tokenizer.hasMoreTokens() ) {

            //TODO add check for eof if necessary

            tokenizer = new StringTokenizer(

                   reader.readLine() );

        }

        return tokenizer.nextToken();

    }



    static int nextInt() throws IOException {

        return Integer.parseInt( next() );

    }

	

    static double nextDouble() throws IOException {

        return Double.parseDouble( next() );

    }
    
    
    static long nextLong() throws IOException{
    	
		return Long.parseLong(next());
	}

}