#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
template <typename T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ld long double
#define nl cout << "\n";
#define getunique(v)                                  \
    {                                                 \
        sort(v.begin(), v.end());                     \
        v.erase(unique(v.begin(), v.end()), v.end()); \
    }
#define forn(a, b) for (int i = a; i < b; i++)
#define __builtin_popcountll __builtin_popcountll
#define __builtin_clzll __builtin_clzll
#define __builtin_ctzll __builtin_ctzll
#define yesno(b) cout << ((b) ? "Yes" : "No");
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define hhh cout << "here" << endl;
#define mod1 1000000007
#define mod2 998244353
const int inf = 1e17 + 1;
#define FL(i, a, n) for (int i = a; i < n; i++)
#define FR(i, a, n) for (int i = a; i >= n; i--)
const int N = 1e6 + 10;
bool prime[15000105];
vi primes;
void sieve(int n)
{
    for (int i = 0; i <= n; i++)
        prime[i] = 1;
    for (int p = 2; p <= n; p++)
    {
        if (prime[p] == true)
        {
            primes.pb(p);
            for (int i = p * p; i <= n; i += p)
                prime[i] = false;
        }
    }
    prime[1] = prime[0] = 0;
}
void solve()
{
    int n;
    cin >> n;
    sort(all(primes));
    int cnt = 0;
    for (auto it : primes)
    {
        bool f = 0;
        while (n % it == 0)
        {
            f = 1;
            n /= it;
        }
        cnt += f;
    }
    if (n > 1)
    {
        cnt++;
    }
    yesno(cnt <= 2);
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int t = 1;
    sieve(N - 1);
    // cin >> t;
    while (t--)
    {
        solve();
        nl;
    }
    return 0;
}