#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#define INF 99999999;
using namespace std;

int factorCount(long long N){
    int count = 0;
    for (long long i = 2; i*i < N; i++) {
        while (N%i == 0) {
            N /= i;
            count++;
        }
    }
    if(N != 1)count++;
    return count;
}

int main(int argc, const char * argv[]) {
    long long N;
    cin >> N;
    //素数,1,それ自身以外で割り切れるかどうか判定
    //
    if(factorCount(N)<3)cout << "No" << endl;
    else cout << "Yes" << endl;
}