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 \leq t \leq 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 \leq n \leq 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$.

Difficulty: interview

Starter code:

Solutions:
t = int(input())

p2 = [1]
for i in range(40):
    p2.append(2 * p2[-1])

ff = 'FastestFinger'
a = 'Ashishgup'


def prime(p):
    for i in range(3, min(4 * 10 ** 4,p), 2):
        if p % i == 0:
            return False
    return True

for i in range(t):
    n = int(input())
    if n == 1:
        print(ff)
    elif n == 2:
        print(a)
    elif n in p2:
        print(ff)
    elif (n % 4 != 2):
        print(a)
    else:
        testp = n//2

        if prime(testp):
            print(ff)
        else:
            print(a)
        


def check(x):
    if x % 2 == 0:
        return False
    d = 3
    while d * d <= x:
        if x % d == 0:
            return False
        d += 2
    return True

for _ in range(int(input())):
    # a, b = map(int, input().split())
    n = int(input())
    if n == 1:
        print('FastestFinger')
        continue
    if n == 2:
        print('Ashishgup')
        continue
    p2 = 0
    while n % 2 == 0:
        n //= 2
        p2 += 1
    if n == 1:
        print('FastestFinger')
    elif p2 != 1:
        print('Ashishgup')
    else:
        if check(n):
            print('FastestFinger')
        else:
            print('Ashishgup')


def cf(x):
    for i in range(3, x):
        if i ** 2 > x:
            return False
        if x % i == 0:
            return True
    return False

def solve():
    n = int(input())
    if n == 1:
        print('FastestFinger')
        return
    if n == 2:
        print('Ashishgup')
        return
    if n % 2 == 0:
        if n // 2 % 2 == 1:
            if cf(n // 2):
                print('Ashishgup')
            else:
                print('FastestFinger')
            return
        if n == (n & -n):
            print('FastestFinger')
        else:
            print('Ashishgup')
    else:
        print('Ashishgup')

t = int(input())
for _ in range(t):
    solve()

def isPrime(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 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

t=int(input())
for _ in range(t):
    n=int(input())
    if n==1:
        print('FastestFinger')
        continue
    if n%2==1:
        print('Ashishgup')
        continue
    if n%4==0:
        while n%2==0:
            n=n//2
        if n==1:
            print('FastestFinger')
        else:
            print('Ashishgup')
        continue
    if isPrime(n//2):
        print('FastestFinger')
    else:
        print('Ashishgup')

from math import sqrt
def deli(x):
    cd = 0
    while x % 2 == 0:
        cd += 1
        x //= 2
    ncd = 0
    for i in range(3, int(sqrt(x)) +1):
        while x % i == 0:
            x//=i
            ncd += 1
    if x != 1:
        ncd += 1
    return cd,ncd
def solvetest():
    n = int(input())
    c,nc = deli(n)
    if n == 1:
        print("FastestFinger")
        return
    if n == 2:
        print("Ashishgup")
        return
    if nc >= 2:
        print("Ashishgup")
        return
    if nc == 0:
        print("FastestFinger")
        return
    if c >= 2:
        print("Ashishgup")
    elif c == 1:
        print("FastestFinger")
    else:
        print("Ashishgup")
for i in range(int(input())):
    solvetest()

import sys
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

def solve():
  n, = I()
  f = 'FastestFinger'
  a = 'Ashishgup'
  if n == 1:
    print(f)
    return
  if n == 2:
    print(a)
    return

  if not (n & (n - 1)):
    print(f)
    return

  lala = 0
  if n % 2:
    print(a)
    return

  count = 0
  while n % 2 == 0:
    n //= 2
    lala += 1

  for i in range(3, int(n ** 0.5) + 10, 2):
    while n % i == 0:
      count += 1
      n //= i

  if n > 1:
    count += 1

  if lala == 1 and count == 1:
    print(f)
    return


  if count % 2:
    print(a)
  else:
    print(a)

t, = I()
while t:
  t -= 1
  solve()


"""
Facts and Data representation
"""


def is_prime(n):
	if n==1:
		return False
	if n==2 or n==3 or n==5:
		return True

	lim = int(n**0.5)
	for d in range(2,lim+1):
		if n%d==0:
			return False;
	return True
def winnable(n):
	if n==2:
		return True
	elif not (n-1)&n: # is power of 2
		return False
	elif n&1:
		return True
	elif n%4==0:
		return True
	elif is_prime(n>>1):
		return False
	else:
		return True
for t in range(int(input())):
	n = int(input())
	print("Ashishgup" if winnable(n) else "FastestFinger")

def mi():
    return list(map(int, input().split()))

'''

'''
def isPrime(n) : 
  
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
  
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
  
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
  
    return True

for _ in range(int(input())):
    n = int(input())
    nc = n
    if n%2 and n>1:
        winner=1
    elif n==1:
        winner=2
    elif n==2:
        winner=1
    else:
        while n%2==0:
            n//=2

        if n%2 and n>1:
            if nc//n>2:
                winner=1
            elif isPrime(n):
                winner=2
            else:
                winner=1
        else:
            winner=2

    if winner==1:
        print('Ashishgup')
    else:
        print('FastestFinger')


from collections import *
from math import *

t = int(input())
for y in range(t):
	n = int(input())
	m = n
	if(n == 1):
		print("FastestFinger")
		continue
	if(n&1):
		print("Ashishgup")
		continue
	ct = 0
	while(n%2 == 0):
		ct += 1
		n //= 2
	if(ct == 1):
		if(m == 2):
			print("Ashishgup")
			continue
		else:
			i = 3
			cnt = 0
			while(i*i <= n):
				while(n%i == 0):
					cnt += 1
					n //= i
				i += 1
			if(n > 1): cnt += 1
			if(cnt == 1):
				print("FastestFinger")
				continue
			else:
				print("Ashishgup")
				continue
	if(n == 1):
		print("FastestFinger")
		continue
	else:
		print("Ashishgup")
		continue


from sys import stdin

def isPrime(n):
    for i in range(2, int(n**0.5+1)):
        if n % i == 0:
            return False
    return True

t = int(stdin.readline().strip())
for _ in range(t):
    n = int(stdin.readline().strip())
    if n == 1:
        print("FastestFinger")
    elif n == 2:
        print("Ashishgup")
    elif n % 2 == 1:
        print("Ashishgup")
    elif n & (n-1) == 0:
        print("FastestFinger")
    elif (n/2) % 2 == 1 and isPrime(n/2):
        print("FastestFinger")
    else:
        print("Ashishgup")


import sys
# import math
from collections import deque
# import heapq
# from math import inf
# from math import gcd

# print(help(deque))
# 26
pprint = lambda s: print(' '.join(map(str, s)))
input = lambda: sys.stdin.readline().strip()
ipnut = input
def is_prime(n):
    i = 2
    while i**2<=n:
        if n%i==0:
            return False
        i+=1
    return True

for i in range(int(input())):
    n = int(input())
    if n==1:
        print('FastestFinger')
    elif n%2==0:
        k = 0
        while n%2==0:
            n//=2
            k+=1
        if n==1:
            if k==1:
                print('Ashishgup')
            else:
                print('FastestFinger')
        else:
            if k == 1:
                if is_prime(n):
                    print('FastestFinger')
                else:
                    print('Ashishgup')
            else:
                print('Ashishgup')
    else:
        print('Ashishgup')

import math
for nt in range(int(input())):
	n = int(input())
	# print (n)
	if n==1:
		print ("FastestFinger")
		continue
	elif n==2:
		print ("Ashishgup")
		continue
	if n%2:
		print ("Ashishgup")
		continue
	x = 0
	m = n
	while n%2==0:
		n = n//2
		x += 1
	if n==1:
		print ("FastestFinger")
		continue
	if x==1:
		left = m//2
		flag = 0
		for i in range(2,int(left**0.5)+1):
			if left%i==0:
				flag =1 
				break
		if flag:
			print ("Ashishgup")
		else:
			print ("FastestFinger")
	else:
		print ("Ashishgup")

import math
t = int(input())
for _ in range(t):
    n = int(input())
    cnt2 = 0
    while n % 2 == 0:
        n //= 2
        cnt2 += 1
    if n == 1 and cnt2 != 1:
        print('FastestFinger')
    elif n == 1:
        print('Ashishgup')
    elif cnt2 == 1:
        isNPrime = True
        rangeLoop = int(math.sqrt(n)) + 1
        for i in range(3,rangeLoop,2):
            if n % i == 0:
                isNPrime = False
                break
        if isNPrime:
            print('FastestFinger')
        else:
            print('Ashishgup')
    else:
        print('Ashishgup')

def read_int():
    return int(input())


def read_ints():
    return list(map(int, input().split(' ')))


from functools import lru_cache


@lru_cache(None)
def solve(n):
    if n == 1:
        return False
    if n % 2 == 1 or n == 2:
        return True
    m = 0
    while n % 2 == 0:
        n //= 2
        m += 1
    if m >= 2 and n == 1:
        return False
    idx = 3
    prime = True
    while idx * idx <= n:
        if n % idx == 0:
            prime = False
            break
        idx += 1
    return m >= 2 or (not prime)


t = read_int()
for case_num in range(t):
    n = read_int()
    print("Ashishgup" if solve(n) else "FastestFinger")