#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <cmath>
#include <iomanip>
#include <functional>
#include <random>
#include <set>
#include <atcoder/string>
#include <atcoder/math>
#include <unordered_map>
#include <climits>
using namespace std;
using ll = long long;
using namespace atcoder;

vector<ll> prime_numbers(ll n){
    if (n <= 1){
        return vector<ll>(0);
    }
    vector<ll> ans = {2};
    for(ll i = 3;i <= n;i++){
        bool is_prime = true;
        for(ll j = 0; ans[j] * ans[j] <= i;j++){
            if (i % ans[j] == 0){
                is_prime = false;
                break;
            }
        }
        if (is_prime){
            ans.push_back(i);
        }
    }
    return ans;
}
vector<ll> primes = prime_numbers(1000001);
void decomposite(ll N, map<ll,ll> &factors,ll p_index = 0){
    if (N == 1){
        return;
    }

    while (primes[p_index] * primes[p_index] <= N ) {
        if (N % primes[p_index] == 0) {
            factors[primes[p_index]] += 1;
            decomposite(N/primes[p_index],factors,p_index);
            return;
        } else {
            p_index++;
        }
    }
    factors[N] += 1;
}

int solve()
{
  ll N;
  cin >> N;
  map<ll,ll> dec;
  decomposite(N,dec);
  if (dec.size() <= 2){
    cout << "Yes\n";
  }else{
    cout << "No\n";
  }
  return 0;
}

int main()
{
  // ll T;
  // cin >> T;
  // while(T--){
  solve();
  // }
  return 0;
}