func_code_string: #include<bits/stdc++.h>   using namespace std;      #define ff                   first   #define ss                   second   #define ll                 long long int   #define ld                   long double   #define pii                  pair<ll,ll>   #define pb                   push_back   #define rep(i,a,b)           for(int i=a;i<b;i++)   #define t(x)                 int t; cin>>t; while(t--)   #define vi                   vector<int>   #define mii                  map<int,int>   #define min3(a, b, c)        min(min(a, b), c)   #define min4(a, b, c, d)     min(min(a, b), min(c, d))   #define max3(a, b, c)        max(max(a, b), c)   #define max4(a, b, c, d)     max(max(a, b), max(c, d))   #define ps(x,y)              fixed<<setprecision(y)<<x   #define setbits(x)           __builtin_popcountll(x)   #define zrobits(x)           __builtin_ctzll(x)   #define all(x)               x.begin(),x.end()   // #define M                  1000000007   #define FIO                  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)   mt19937                      rng(chrono::steady_clock::now().time_since_epoch().count());      bool isPerfectSquare(ll x)   {       // Find floating point value of       // square root of x.       if (x >= 0) {              long long sr = sqrt(x);              // if product of square root           //is equal, then           // return T/F           return (sr * sr == x);       }       // else return false if n<0       return false;   }   int main()   {       FIO;   #ifndef ONLINE_JUDGE       freopen( input.txt ,  r , stdin);       freopen( output.txt ,  w , stdout);   #endif          t(x)       {           ll n;           cin >> n;           ll a[n];           ll check = 0;           rep(i, 0, n)           {               cin >> a[i];               if (!isPerfectSquare(a[i]))                   check = 1;           }           if (check)               cout <<  YES  << endl;           else               cout <<  NO  << endl;             }   }         