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

import java.util.Scanner;
import java.util.Stack;
import java.util.TreeMap;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.PriorityQueue;

public class pac1 {
	static Scanner scn = new Scanner(System.in);
	static int mod = 1000000007;

	public static void main(String[] args) {

		int t = scn.nextInt();
		while (t-- > 0) {
			int n = scn.nextInt();
			if (n == 1)
				System.out.println("FastestFinger");
			else if (n % 2 == 1||n==2) {
				System.out.println("Ashishgup");
			} 
			else if (n % 2 == 0) {
				ArrayList<Integer> list = new ArrayList<Integer>();
				for (int i = 1; i <= Math.sqrt(n); i++) {
					if (n % i == 0) {
						if (i == n / i) {
							list.add(i);
						} else {
							list.add(i);
							list.add(n / i);
						}
					}
				}
				int a = 0,k=1;
				for (int i = 0; i < list.size(); i++) {
					if (list.get(i) % 2 != 0 &&list.get(i)>1) {
						k=list.get(i);
						a++;
					}
				}
				 //System.out.println(list);
				if (a ==0) {
					if (n !=2)
						System.out.println("FastestFinger");
					else
						System.out.println("Ashishgup");
				} 
				
				else 
				{
					if(a>1)
					{
						System.out.println("Ashishgup");
					}
					else
					{	//System.out.println(k);
						if(n/k!=2)
							System.out.println("Ashishgup");
						else
							System.out.println("FastestFinger");
					}
				}
				// System.out.println(a);
			}
		}
	}

	public static int maxhappy(int arr[][], int i, int j) {
		if (i == arr.length) {
			return 0;
		}

		int a = Integer.MIN_VALUE, b = Integer.MIN_VALUE;
		for (int k = 0; k < 3; k++) {
			if (k != j) {
				b = maxhappy(arr, i + 1, k) + arr[i][k];
			}
			a = Math.max(a, b);
		}
		return a;
	}

	public static long string(int n, String str, long memo[]) {
		if (str.length() == n) {
			boolean bl = true;
			for (int i = 0; i < n - 1; i++) {
				if (str.charAt(i) == '1' && str.charAt(i + 1) == '1') {
					bl = false;
					break;
				}
			}
			if (bl)
				return 1;
			else
				return 0;
		}

		long a = (string(n, str + "0", memo)) % mod;
		long b = (string(n, str + "1", memo)) % mod;
		return (a + b) % mod;
	}

	public static int gcd(int a, int n) {

		if (a == 0)
			return n;
		return gcd(n % a, a);
	}
}

class pair {
	int x;
	int y;

	pair(int a, int b) {
		this.x = a;
		this.y = b;
	}
}

class sorting implements Comparator<pair> {

	@Override
	public int compare(pair o1, pair o2) {
		// TODO Auto-generated method stub

		int a = Math.max(o1.x, o2.x), b = o1.y - o2.y;
		if (b > 0)
			return -1;
		else
			return 0;
	}

}
