#include <bits/stdc++.h>

using namespace std;

class Prime {
 public:
  template <typename T>
  static bool is_prime(T n) {
    if (n == 0 || n == 1) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    for (T i = 3; i * i < n + 1; i += 2) {
      if (n % i == 0) return false;
    }
    return true;
  }

  template <typename T>
  static std::vector<std::pair<T, int>> factor(T n) {
    std::vector<T> primes;
    for (T i = 2; i * i < n + 1; i++) {
      while (n % i == 0) {
        n /= i;
        primes.emplace_back(i);
      }
    }
    if (n != 1) primes.emplace_back(n);
    std::map<T, int> mp;
    for (T p : primes) {
      mp[p]++;
    }
    std::vector<std::pair<T, int>> res;
    for (const auto &[p, c] : mp) {
      res.emplace_back(std::make_pair(p, c));
    }
    return res;
  }

  template <typename T>
  static T totient(T n) {
    T res = 1;
    std::vector<std::pair<T, int>> primes = factor(n);
    for (std::pair<T, int> &p : primes) {
      res *= pow(p.first, p.second - 1) * (p.first - 1);
    }
    return res;
  }

  template <typename T>
  static std::vector<T> sieve_of_eratosthenes(T n) {
    std::vector<bool> is_prime(n + 1, true);
    is_prime[0] = is_prime[1] = false;
    for (T i = 2; i * i < n + 1; i++) {
      if (!is_prime[i]) continue;
      for (T k = 2 * i; k < n + 1; k += i) {
        is_prime[k] = false;
      }
    }
    std::vector<T> res;
    for (T i = 0; i < n + 1; i++) {
      if (is_prime[i]) res.emplace_back(i);
    }
    return res;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t N;
  cin >> N;
  auto primes = Prime::factor(N);
  int cnt = 0;
  for (auto p : primes) {
    cnt += p.second - 1;
  }
  if (cnt > 0 || (int)primes.size() > 2) {
    cout << "YES" << '\n';
  } else {
    cout << "NO" << '\n';
  }
  return 0;
}