/*#include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include //fixed,setprecision #include //INT_MAX #include //M_PI #include #include */ #include using namespace std; #include using namespace atcoder; using mint = modint1000000007; //using mint = modint998244353; //std::chrono::time_point start; template bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; } template bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; } #define ll long long #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) typedef pair P; ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } ll lcm(ll a, ll b){return a * b / gcd(a, b);} template //contain(string s,string v) sにvが含まれるかを判定 bool contain(const std::basic_string& s, const U& v) { return s.find(v) != std::basic_string::npos; } std::chrono::time_point start; vector>factorize(ll n){ vector>res; for(ll i=2;i*i<=n;++i){ if(n%i)continue; res.emplace_back(i,0); while(n%i==0){ n/=i; res.back().second++; } } if(n!=1)res.emplace_back(n,1); return res; } int main(){ ll n; cin>>n; auto f=factorize(n); rep(i,f.size()){ if(f[i].second%3!=0){ cout<<"No"<