#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

/* ---- */
#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a) {
  for (auto x : a) cerr << x << ' ';
  cerr << endl;
}

void print(auto x) { cerr << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cerr << head << ' ';
  print(forward<Tail>(tail)...);
}

const ll mod = 998244353;

void solve(){
  ll n;
  cin>>n;
  vector<pair<ll,ll>>p;
  ll j=sqrtl(n);
  for(ll i=0;i*i<=n;i++){
    while(i*i+j*j>n)j--;
    if(i*i+j*j==n){
      p.push_back({i,j});
    }
  }
  if(p.size()==0){
    cout<<"inf"<<endl;
    return;
  }
  ll g=0;
  for(auto [x,y]:p){
    g=__gcd(x,g);
    g=__gcd(y,g);
  }
  bool flag=true;
  for(auto [x,y]:p){
    if(((x/g)+(y/g)%2)==1){
      flag=false;
    }
  }
  if(flag)cout<<g*g*2<<endl;
  else cout<<g*g<<endl;
}

int main(){
  int T;
  cin>>T;
  rep(i,T)solve();
}