#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}


int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int T;cin >> T;
  while(T--){
    ll n;cin >> n;
    n = abs(n);
    if(n == 1){
      cout << "Yes\n";
      cout << 0 << "\n";
    }else{
      cout << "No\n";
      auto cal = [](ll k){
        ll tw = 0,fi = 0;
        while(!(k & 1)){
          tw++;
          k >>= 1;
        }
        while(k%5 == 0){
          fi++;
          k /= 5;
        }
        return P{tw,fi};
      };
      auto [tw,fi] = cal(n*n-2*n+2);
      P g = cal(n*n+2*n+2);
      tw += g.first;fi += g.second;
      cout << min(tw,fi) << "\n";
    }
  }

  

  return 0;
}