#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

vector<int> primes;
bool f[10000001] = {};
void sieve(){
    for(int i = 2; i < 10000001; i++){
        if(!f[i]){
            primes.push_back(i);
            int j = 2;
            while(j*i < 10000001){
                f[j*i] = true;
                j++;
            }
        }
    }
}

void solve(){
    ll n; cin >> n;
    int cnt = 0;
    sieve();
    for(int x : primes){
        if(n % x == 0){
            cnt++;
            while(n%x==0) n /= x;
        }
        if(n == 1) break;
    }
    if(n>1) cnt++;
    if(cnt >= 3){
        cout << "No";
    }else {
        cout << "Yes";
    }
}

int main(){

    solve();

    return 0;
}