#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll n_ = 1e6 + 10, inf = 1e18, mod = 1e9 + 7;
ll n, m, a, b, c, d, x, y, t, k, u, h;
ll dp[n_];
bool isprime(ll x) {
  for (ll i = 2; i * i <= x; i++)
    if ((x % i) == 0) return false;
  return true;
}
void solve() {
  ll ans = 0;
  cin >> n;
  bool ok = true;
  if (n == 1 || n == 2)
    ok = n == 2 ? 1 : 0;
  else if (n % 2)
    ok = true;
  else {
    a = n;
    while (a % 2 == 0) a /= 2;
    if (a == 1) ok = false;
    n /= 2;
    if (isprime(n)) ok = false;
  }
  if (ok)
    cout << "Ashishgup" << '\n';
  else
    cout << "FastestFinger" << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> t;
  while (t--) solve();
}
