#include #define rep(i, n) for (int i = 0; i < n; ++i) typedef long long ll; using namespace std; const int MOD = 1e9 + 7; int main() { ll N; cin >> N; ll cur = 1; while (cur * cur * cur < N) cur++; if (cur * cur * cur == N) cout << "Yes\n"; else cout << "No\n"; return 0; }