#include <bits/stdc++.h>
 
using namespace std;

vector<long long> make_prime(const int& num) {
  vector<char> is_prime(num+1, 1);
  for (int i=2;i*i<=num;++i) {
    if (is_prime[i] == 0) continue;
    for (int j=i+i;j<=num;j+=i) is_prime[j] = 0;
  }
  vector<long long> prime;
  for (int i=2;i<=num;++i) if (is_prime[i] == 1) prime.push_back(i);
  return prime;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  long long n;
  cin >> n;
  vector<long long> prime = make_prime(1001001);
  int cnt {};
  for (const auto& e : prime) {
    if (n % e == 0) {
      while (n % e == 0) n /= e;
      ++cnt;
    }
  }
  if (cnt == 2 && n != 1) cout << "No\n";
  if (cnt <= 2) cout << "Yes\n";
  else cout << "No\n";
}