#pragma GCC optimize ( "O3" )
#pragma GCC optimize( "unroll-loops" )
#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
#include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <cassert>
using namespace std;

using ll = long long;

#define MAIN main
#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr )
#define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE
#define CIN( LL , A ) LL A; cin >> A
#define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX )
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX )
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT ## HOW_MANY_TIMES , 0 , HOW_MANY_TIMES )
#define QUIT return 0
#define COUT( ANSWER ) cout << ( ANSWER ) << "\n"
#define RETURN( ANSWER ) COUT( ANSWER ); QUIT

int MAIN()
{
  UNTIE;
  CEXPR( int , bound_T , 100000 );
  CIN_ASSERT( T , 1 , bound_T );
  CEXPR( ll , bound_N , 1000000000 );
  constexpr int prime[2] = { 2 , 5 };
  REPEAT( T ){
    CIN_ASSERT( N , - bound_N , bound_N );
    if( N == 1 || N == -1 ){
      COUT( "Yes" );
      COUT( 0 );
    } else {
      int count[2] = {};
      ll factor[2] = { N * N + 2 * N + 2 , N * N - 2 * N + 2 };
      FOR( i , 0 , 2 ){
	ll& factor_i = factor[i];
	FOR( j , 0 , 2 ){
	  const int& prime_j = prime[j];
	  int& count_j = count[j];
	  while( factor_i % prime_j == 0 ){
	    factor_i /= prime_j;
	    count_j++;
	  }
	}
      }
      COUT( "No" );
      COUT( min( count[0] , count[1] ) );
    }
  }
  QUIT;
}