func_code_string: #include<bits/stdc++.h>   using namespace std;   #define int long long int   #define intu unsigned long long int   #define vi vector<int>   #define ii pair<int,int>   #define pb push_back   #define ff first   #define ss second   #define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);   # define PI           3.14159265358979323846    #define all(a) a.begin(),a.end()   #define for0(i, n) for (int i = 0; i < n; i++)   #define for1(i, n) for (int i = 1; i <= n; i++)   #define loop(i,a,b) for (int i = a; i < b; i++)   #define bloop(i,a,b) for (int i = a ; i>=b;i--)   #define tc(t) int t; cin >> t; while (t--)   int mod = 1000000007;   int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}   int lcm(int a, int b) {return a * b / gcd(a, b); }   int bpow(int a,int b)    {     int res = 1;     while (b > 0) {       if (b & 1)res = ((res) * (a));         a = ((a) * (a));         b >>= 1;     }     return res;   }   int fact(int n) {       if ((n==0)||(n==1))         return 1;       else         return ((n%mod) * (fact(n-1))%mod)%mod;   }   void go()   {   #ifndef ONLINE_JUDGE     freopen( input.txt , r ,stdin);     freopen( output.txt , w ,stdout);     #endif   }      map<int,int> mp;      signed main()      {          fast_io         go();            tc(t){           int n;cin>>n;           vi v(n);           bool yes=0;           for0(i,n){             cin>>v[i];                        }           for0(i,n){                          int yo=sqrt(v[i]);             if(yo*yo!=v[i]){               yes=1;               break;             }           }                if(yes)             cout <<  YES  <<   n ;           else             cout <<  NO  <<   n ;                    }       }                        