#include <iostream>
#include <cmath>
using namespace std;

/*二分法*/
long long sqrt_floor(long long n)
{
    long long left = 1;
    long long right = 1e9+1;
    long long ans=0;
    while(left<=right)
    {
        long long mid=(left+right)/2;
        if(mid<=n/mid)
        {
            ans = mid;
            left = mid+1;
        }
        else {
            right=mid-1;
        }
    }
    return ans;
}

int main() {
    int n;cin>>n;
    for(int i=0;i<n;i++)
    {
        long long num;cin>>num;
        long long res = sqrt_floor(num);
        if(res*res==num) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
        
    }
}
// 64 位输出请用 printf("%lld")