#include <bits/stdc++.h> using namespace std; typedef long long ll; bool isPrime(ll n) { if (n < 2) return false; if (n == 2) return true; if (n % 2 == 0) return false; ll sq = sqrt(n); for (ll i = 3; i <= sq; i += 2) { if (n % i == 0) return false; } return true; } bool isPrimePower(ll x) { if (isPrime(x)) return false; ll sq = sqrt(x); for (ll i = 2; i <= sq; ++i) { if (x % i == 0) { if (!isPrime(i)) continue; ll tmp = x; while (tmp % i == 0) tmp /= i; return tmp == 1; } } return false; } int main() { ios::sync_with_stdio(false); cin.tie(0); int q; cin >> q; while (q--) { ll x; cin >> x; if (isPrime(x)) { cout << "No\n"; } else if (isPrimePower(x)) { cout << "No\n"; } else { cout << "Yes\n"; } } return 0; }