//#include #include using namespace std; typedef long long ll; typedef pair p; const ll INF = 1e9; const ll LINF = ll(1e18); const ll MOD = 1000000007; const ll dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const ll Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (ll i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } //cout< res; for (ll i = 2; i * i <= n; i++) { while (n % i == 0) { ++res[i]; n /= i; if(res[i]>=2)return true; } } if (n != 1) res[n] = 1; if(res.size()>=3){ return true; } else return false; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n; if(prime_factor(n))yes; else no; }