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.*;

public class Codeforces_1370_C {
	static FastReader sc;
	static PrintWriter pw;

	public static void main(String[] args) throws FileNotFoundException {
		boolean submit = true;
		sc = new FastReader(submit);
		pw = new PrintWriter(System.out);

		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {

			solve();
			pw.flush();
		}

		pw.close();

	}

	static void solve() {
		// Solution
		String p1 = "Ashishgup";
		String p2 = "FastestFinger";
		long N = sc.nextInt();

		if (N == 1) {
			Println(p2);
			return;
		}
		if (N % 2 == 1) {
			Println(p1);
			return;
		}
		if (N == 2) {
			Println(p1);
			return;
		}
		if (Long.bitCount(N) == 1) {
			Println(p2);
			return;
		}
		
		long N1=N;
		int pow2=0;
		while(N1%2==0) {
			N1/=2;
			pow2++;
		}
		
		if(pow2>1) {
			Println(p1);
			return;
		}
		
		long odd_part=N/2;
		boolean prime=isPrime(odd_part);
		if(prime) {
			Println(p2);
		}
		else {
			Println(p1);
		}
		
	}

	/*
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 * 
	 */
	
	static boolean isPrime(long n) 
    { 
        // Corner cases 
        if (n <= 1) 
            return false; 
        if (n <= 3) 
            return true; 
  
        // This is checked so that we can skip 
        // middle five numbers in below loop 
        if (n % 2 == 0 || n % 3 == 0) 
            return false; 
  
        for (int i = 5; i * i <= n; i = i + 6) 
            if (n % i == 0 || n % (i + 2) == 0) 
                return false; 
  
        return true; 
    } 

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader(boolean b) throws FileNotFoundException {
			if (b) {
				br = new BufferedReader(new InputStreamReader(System.in));
			} else {
				br = new BufferedReader(new FileReader("src/input.txt"));
			}

		}

		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;
		}
	}

	static int _int() {
		return sc.nextInt();
	}

	static int[] _int(int n) {
		int[] Arr = new int[n];
		for (int i = 0; i < n; i++) {
			Arr[i] = sc.nextInt();
		}
		return Arr;
	}

	static int[][] _int(int m, int n) {
		int[][] Arr = new int[m][n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				Arr[i][j] = sc.nextInt();
			}
		}
		return Arr;
	}

	static long _long() {
		return sc.nextLong();
	}

	static long[] _long(int n) {
		long[] Arr = new long[n];
		for (int i = 0; i < n; i++) {
			Arr[i] = sc.nextLong();
		}
		return Arr;
	}

	static long[][] _long(int m, int n) {
		long[][] Arr = new long[m][n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				Arr[i][j] = sc.nextLong();
			}
		}
		return Arr;
	}

	static String _string() {
		return sc.next();
	}

	static String[] _string(int n) {
		String[] s = new String[n];
		for (int i = 0; i < n; i++) {
			s[i] = sc.next();
		}
		return s;
	}

	static char _char() {
		return sc.next().charAt(0);
	}

	static char[] _chars() {
		return sc.next().toCharArray();
	}

	static char[] _char(int n) {
		char[] c = new char[n];
		for (int i = 0; i < n; i++) {
			c[i] = sc.next().charAt(0);
		}
		return c;
	}

	static char[][] _chars(int n) {
		char[][] C = new char[n][];
		for (int i = 0; i < n; i++) {
			C[i] = _chars();
		}
		return C;
	}

	static char[][] _char(int m, int n) {
		char[][] C = new char[m][n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				C[m][n] = sc.next().charAt(0);
			}
		}
		return C;
	}

	static int max(int m, int n) {
		return m > n ? m : n;
	}

	static int min(int m, int n) {
		return m < n ? m : n;
	}

	static long max(long m, long n) {
		return m > n ? m : n;
	}

	static long min(long m, long n) {
		return m < n ? m : n;
	}

	static int max(Iterable<Integer> A) {
		int ans = Integer.MIN_VALUE;
		for (int i : A) {
			if (i > ans) {
				ans = i;
			}
		}
		return ans;
	}

	static int min(Iterable<Integer> A) {
		int ans = Integer.MAX_VALUE;
		for (int i : A) {
			if (i < ans) {
				ans = i;
			}
		}
		return ans;
	}

	static int max(int[] A) {
		int ans = Integer.MIN_VALUE;
		for (int i : A) {
			if (i > ans) {
				ans = i;
			}
		}
		return ans;
	}

	static int min(int[] A) {
		int ans = Integer.MAX_VALUE;
		for (int i : A) {
			if (i < ans) {
				ans = i;
			}
		}
		return ans;
	}

	static void Println() {
		pw.println();
	}

	static void Print(long x) {
		pw.print(x);
	}

	static void Println(long x) {
		pw.println(x);
	}

	static void Print(String s) {
		pw.print(s);
	}

	static void Println(String s) {
		pw.println(s);
	}

	static void Println(String[] A) {
		for (String s : A) {
			pw.println(s);
		}
	}

	static void Print(String[] A) {
		for (String s : A) {
			pw.print(s + " ");
		}
		pw.println();
	}

	static void Print(int[] A) {
		for (int i : A) {
			pw.print(i + " ");
		}
		pw.println();
	}

	static void Println(int[] A) {
		for (int i : A) {
			pw.println(i);
		}
	}

	static void Println(int[][] A) {
		for (int[] a : A) {
			for (int i : a) {
				pw.print(i + " ");
			}
			pw.println();
		}
	}

	static void Sort(int[] A) {
		Arrays.sort(A);
	}

	static void Sort(List<Integer> A) {
		Collections.sort(A);
	}

	static void Sortr(int[] A) {
		Arrays.sort(A);
		reverse(A);
	}

	static void reverse(int[] A) {
		int n = A.length;
		if (n < 2)
			return;
		int temp;
		for (int i = 0; i < n / 2; i++) {
			temp = A[i];
			A[i] = A[n - i - 1];
			A[n - i - 1] = temp;
		}
	}

	static void Sortr(List<Integer> A) {
		Collections.sort(A, Collections.reverseOrder());
	}

}
