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.
import javafx.collections.transformation.SortedList;
import javafx.util.Pair;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;


public class q_3 {
    static Scanner sc;
    static FastReader fr;
    public static void main(String[] args){
        sc = new Scanner(System.in);
        fr = new FastReader();
        int test = fr.nextInt();
        List<Integer> primes = getPrimesTill(1000000000);
        for(int tt=0; tt<test; tt++){
            int n = fr.nextInt();
            int k = n;
            boolean ashish = true;
            if(n%2==1){
                ashish = true;
            }
            else {
                // does it have odd
                int twos = 0;
                while (n%2==0){
                    twos++;
                    n/=2;
                }
                if(n==1){
                    if(twos!=1) {
                        ashish = false;
                    }
                }
                else {
                    if(twos==1){
                        // find odd factor count
                        boolean isPrime = true;
                        for(int prime: primes){
                            if(n%prime==0){
                                if(prime==n){
                                    isPrime=true;
                                    break;
                                }
                                else {
                                    isPrime = false;
                                    break;
                                }
                            }
                            if(prime>n){
                                break;
                            }
                        }
                        if(isPrime){
                            ashish = false;
                        }
                        else {
                            ashish = true;
                        }

                    }
                    else {
                        ashish = true;
                    }
                }
            }
            if(k==1){
                ashish = false;
            }
            if(ashish){
                System.out.println("Ashishgup");
            }
            else{
                System.out.println("FastestFinger");
            }

        }
    }

    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

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

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static Integer[] getIntArrayFromSingleLine(){
        List<Integer> list = new LinkedList<>();
        String[] str = fr.nextLine().split(" ");
        for(String s: str){
            list.add(Integer.parseInt(s));
        }
        Integer[] arr = new Integer[list.size()];
        return list.toArray(arr);
    }

    public static Long[] getLongArrayFromSingleLine(){
        List<Long> list = new LinkedList<>();
        String[] str = fr.nextLine().split(" ");
        for(String s: str){
            list.add(Long.parseLong(s));
        }
        Long[] longs = new Long[list.size()];
        return list.toArray(longs);
    }

    public static Double[] getDoubleArrayFromSingleLine(){
        List<Double> list = new LinkedList<>();
        String[] str= fr.nextLine().split(" ");
        for(String s: str){
            list.add(Double.parseDouble(s));
        }
        Double[] doubles = new Double[list.size()];
        return list.toArray(doubles);
    }

    public static String[] getStringArrayFromSingleLine(){
        return fr.nextLine().split(" ");
    }

    public static int[] getArray(int n){
        int[] arr = new int[n];
        for(int i=0; i<n; i++){
            arr[i] = fr.nextInt();
        }
        return arr;
    }

    public static long[] getLongArray(int n){
        long[] res = new long[n];
        for(int i=0; i<n; i++){
            res[i] = fr.nextLong();
        }
        return res;
    }

    public static double[] getDoubleArray(int n){
        double[] arr = new double[n];
        for(int i=0; i<n ; i++){
            arr[i] = fr.nextDouble();
        }
        return arr;
    }

    public static char[] getCharArray(){
        return fr.next().toCharArray();
    }

    public static String[] getStringArray(int n){
        String[] strings = new String[n];
        for(int i=0; i<n; i++){
            strings[i] = fr.next();
        }
        return strings;
    }

    // Get GCD
    public static int getGCD(int a, int b){
        return (a==0 ? b : getGCD(b%a, a));
    }

    public static int getGCD(int[] arr){
        int n = arr.length;
        if(n==0){
            return -1;
        }
        int res = arr[0];
        for(int i=1; i<n; i++){
            res = getGCD(res, arr[i]);
        }
        return res;
    }

    // Get all prime numbers till N using seive of Eratosthenes
    public static List<Integer> getPrimesTill(int n){
        int range = (int) Math.ceil(Math.sqrt(n+1));
        boolean[] arr = new boolean[range+1];
        List<Integer> primes = new LinkedList<>();
        for(int i=2; i<=range; i++){
            if(!arr[i]){
                primes.add(i);
                for(long j=(i*i); j<=range; j+=i){
                    arr[(int)j] = true;
                }
            }
        }
        return primes;
    }


    // This method returns list of PrimeFactors of a number in O(sqrt(N));
    public static Map<Integer,Integer> getPrimeFactors(long n){
        Map<Integer,Integer> res = new HashMap<>();
        int sqrt = (int) Math.sqrt(n);
        if(n%2 == 0){
            int c = 0;
            while(n%2==0){
                c++;
                n/=2;
            }
            res.put(2,c);
        }
        for(int i=3; i<=sqrt; i+=2){
            if(n%i == 0) {
                int c = 0;
                while (n % i == 0) {
                    c++;
                    n /= i;
                }
                res.put(i,c);
            }
        }
        if(n!=1){
            res.put((int)n,1);
        }
        return res;
    }

}