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.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

import javax.xml.crypto.dsig.spec.C14NMethodParameterSpec;

public class GlobalRound8 {

	static int X[] = { -1, 0, 0, 1 };
	static int Y[] = { 0, -1, 1, 0 };

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[64]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	public static long[] initArray(int n, Reader scan) throws IOException {

		long arr[] = new long[n];
		for (int i = 0; i < n; i++) {
			arr[i] = scan.nextLong();
		}

		return arr;
	}

	public static long sum(long arr[]) {

		long sum = 0;
		for (long i : arr) {
			sum += (long) i;
		}

		return sum;
	}

	public static long max(long arr[]) {

		long max = Long.MIN_VALUE;

		for (long i : arr) {
			max = Math.max(i, max);
		}

		return max;
	}

	public static long min(long arr[]) {
		long min = Long.MAX_VALUE;

		for (long i : arr) {
			min = Math.min(i, min);
		}

		return min;
	}

	public static List<Integer>[] initAdjacency(int n, int e, Reader scan, boolean type) throws IOException {

		List<Integer> adj[] = new ArrayList[n + 1];

		for (int i = 0; i < e; i++) {
			int u = scan.nextInt();
			int v = scan.nextInt();

			if (adj[u] == null)
				adj[u] = new ArrayList<>();
			if (type && adj[v] == null)
				adj[v] = new ArrayList<>();

			adj[u].add(v);

			if (type)
				adj[v].add(u);

		}

		return adj;
	}
	public static void main(String[] args) throws IOException {
		
		Reader scan=new Reader();
//		Scanner scan=new Scanner(System.in);
		
		int t=scan.nextInt();
		while(t-->0) {
			
			int n=scan.nextInt();
//			long k=scan.nextLong();
//			
//			int arr[]=new int[n];
//			
//			for(int i=0;i<n;i++) {
//				arr[i]=scan.nextInt();
//			}
			
//			long arr[]=initArray(2*n, scan);
			C(n);
			
		}
	}
	
	
	public static void A(int n) {
		
		if(n%2==0) {
			System.out.println(n/2);
		}else {
			System.out.println((n-1)/2);
		}
		
	}
	
	public static void B(int n, long arr[]) {
		
		List<Integer> odds=new ArrayList<>();
		List<Integer> even=new ArrayList<>();
		
		for(int i=0;i<n;i++) {
			if(arr[i]%2==0) {
				even.add(i);
			}else {
				odds.add(i);
			}
		}
		
		if(odds.size()%2==0&&even.size()%2==0) {
			
			if(odds.size()!=0) {
				odds.remove(0);
				odds.remove(0);
			}else {
				even.remove(0);
				even.remove(0);
			}
			
			for(int i=0;i<odds.size();i+=2) {
				System.out.println((odds.get(i)+1)+" "+(odds.get(i+1)+1));
			}
			
			for(int i=0;i<even.size();i+=2) {
				System.out.println((even.get(i)+1)+" "+(even.get(i+1)+1));
			}
			
			return;
			
		}
		
		if(odds.size()%2!=0&&even.size()%2!=0) {
			
			odds.remove(0);
			even.remove(0);
			
			for(int i=0;i<odds.size();i+=2) {
				System.out.println((odds.get(i)+1)+" "+(odds.get(i+1)+1));
			}
			
			for(int i=0;i<even.size();i+=2) {
				System.out.println((even.get(i)+1)+" "+(even.get(i+1)+1));
			}
			
			return;
		}
		
		
		
	}
	
	
	
	public static void C(int n) {
		
		if(n==1) {
			System.out.println("FastestFinger");
			return;
		}
		
		if(n==2) {
			System.out.println("Ashishgup");
			return;
		}
		
		if(n%2!=0) {
			System.out.println("Ashishgup");
			return;
		}
		
		int count=0;
		int temp=n;
		while(n>0) {
			
			if(n%2==0) {
				count++;
				n/=2;
				continue;
			}else {
				break;
			}
		}
		
		int oddVal= temp/(int)(Math.pow(2, count)); 
		
		if(oddVal==1) {
			System.out.println("FastestFinger");
		}else if(count!=1) {
			System.out.println("Ashishgup");
		}else {
			
			boolean prime=true;
			for(int i=3;i*i<=oddVal;i++) {
				
				if(oddVal%i==0) {
					prime=false;
					break;
				}
				
			}
			
			if(prime) {
				System.out.println("FastestFinger");
			}else {
				System.out.println("Ashishgup");
			}
			
			
		}
		
		
	}
	
	public static void D(int n, long arr[]) {
		PriorityQueue<Long> pq=new PriorityQueue<>(Collections.reverseOrder());
		
		for(long x: arr) {
			pq.add(x);
		}
		
		long ans=0;
		while(!pq.isEmpty()) {
			
			long max= pq.remove();
			
			while(!pq.isEmpty()) {
				long nextMax= pq.remove();
			}
			
		}
	}
	

}
