过但问

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758#include <bits/stdc++.h>
using namespace std;
#define int long long

vector<int> pr;
bool isp[4005];

void eula(int N){
	memset(isp, 1, sizeof isp);
	isp[1] = 0;
	for(int i = 2; i <= N; ++ i){
		if(isp[i])
			pr.push_back(i);
		for(int j = 0; j < pr.size() && i * pr[j] <= N; ++ j){
			isp[i * pr[j]] = 0;
			if(i % pr[j] == 0)
				break;
		}
	}
}

bool check2(int x){
	int y = sqrt(x);
	return y * y == x;
}

bool check3(int x){
	int y = cbrt(x);
	return y * y * y == x;
}

void solve(){
	int x;
	cin >> x;
	for(int p : pr)
		if(x % p == 0){
			int y = 0;
			while(x % p == 0)
				x /= p, ++ y;
			if(y == 1){
				cout << "no\n";
				return;
			}
		}
	cout << ((check2(x) || check3(x)) ? "yes\n" : "no\n");
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	eula(4000);
	int T;
	cin >> T;
	while(T --)
		solve();
	
	return 0;
}

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364#include <bits/stdc++.h>
using namespace std;
#define int long long

vector<int> pr;
bool isp[4005];

void eula(int N){
	memset(isp, 1, sizeof isp);
	isp[1] = 0;
	for(int i = 2; i <= N; ++ i){
		if(isp[i])
			pr.push_back(i);
		for(int j = 0; j < pr.size() && i * pr[j] <= N; ++ j){
			isp[i * pr[j]] = 0;
			if(i % pr[j] == 0)
				break;
		}
	}
}

bool check2(int x){
	int y = sqrt(x);
	if(y * y == x) return true;
	if((y+1)*(y+1) == x) return true;
	if(y > 0 && (y-1)*(y-1) == x) return true;
	return false;
}

bool check3(int x){
	int y = cbrt(x);
	if(y * y * y == x) return true;
	if((y+1)*(y+1)*(y+1) == x) return true;
	if(y > 0 && (y-1)*(y-1)*(y-1) == x) return true;
	return false;
}

void solve(){
	int x;
	cin >> x;
	for(int p : pr)
		if(x % p == 0){
			int y = 0;
			while(x % p == 0)
				x /= p, ++ y;
			if(y == 1){
				cout << "no\n";
				return;
			}
		}
	cout << ((check2(x) || check3(x)) ? "yes\n" : "no\n");
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	eula(4000);
	int T;
	cin >> T;
	while(T --)
		solve();
	
	return 0;
}