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 java.util.*;
import java.io.*;
import java.io.BufferedReader;
import java.awt.Point;

public class Z_C{
	public static final long mod= 1000000007;
	public static Debug db;

	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Autocompletion solver = new Autocompletion();
		db=new Debug(System.getSecurityManager()==null);
		solver.solve(1, in, out);
		out.close();
	}
	static class Autocompletion {

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int t=in.nextInt();
			for(int z1=0;z1<t;z1++) {
				int n=in.nextInt();
				long i=1;
				boolean w=false;
				while(i<n) {
					i=i*2;
				}
				if(i==n) {
					w=true;
				}
				if(n==1) {
					out.println("FastestFinger");
				}
				else if(n==2) {
					out.println("Ashishgup");
				}
				else if(n%2==1) {
					out.println("Ashishgup");	
				}
				else if(w) {//pow of 2
					out.println("FastestFinger");
				}
				else if(n%4==0) {
					out.println("Ashishgup");
				}
				else{
					int arr[]=divisors(n);
					if(arr.length>=6) {
						out.println("Ashishgup");
					}
					else {
						out.println("FastestFinger");
					}
					
				}
			}
		}
		public static int[] divisors(int n) {
			ArrayList<Integer> temp=new ArrayList<Integer>();
			int i;
			temp.clear();
			for (i = 1; i * i < n; i++) {
				if (n % i == 0)
					temp.add(i);
			}
			int[] divisors;
			if (i * i == n) {
				divisors = new int[2 * temp.size() + 1]; 
				divisors[temp.size()] = i;
			} else
				divisors = new int[2 * temp.size()];
			for (int j = 0; j < temp.size(); j++) {
				divisors[j] = temp.get(j);
				divisors[divisors.length - 1 - j] = n / temp.get(j);
			}
			return divisors;
		}
	}

	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
        	return Long.parseLong(next());
        }
        public int[] nextIntArr(int n) {
        	int arr[]=new int[n];
        	for(int i=0;i<n;i++) {
        		arr[i]=this.nextInt();
        	}
        	return arr;
        }
    }
	public static class Debug {
        private boolean allowDebug;
 
        public Debug(boolean allowDebug) {
            this.allowDebug = allowDebug;
        }
 
        private void outputName(String name) {
            System.out.print(name + " = ");
        }
 
        public void debug(String name, int x) {
            if (!allowDebug) {
                return;
            }
 
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, long x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, double x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, int[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
 
        public void debug(String name, long[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
 
        public void debug(String name, double[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
 
        public void debug(String name, Object x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, Object... x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.deepToString(x));
        }
    }
}
