// ?????? ????? ??????????? ???????????
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define pb push_back
#define all(x) x.begin(), x.end()
#define int long long
#define py cout << "Yes\n";
#define pn cout << "No\n";
#define forn(a, b) for (int i = a; i < b; i++)
#define nl cout << endl;
#define pii pair<int, int>
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mod = 1e9 + 7;

void solve();

signed main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tc = 1;

    while (tc--)
        solve();

    return 0;
}
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
    {
        if (n % i == 0)
            return false;
    }

    return true;
}

void solve()
{
    int n;
    cin >> n;
    int count = 0;

    for (int i = 2; i <= n / 2; i++)
    {
        if (!isPrime(i))
        {
            continue;
        }

        if (n % i == 0)
            count++;

        if (count > 2)
            break;
    }

    if (count > 2)
    {
        pn;
    }
    else
    {
        py;
    }
}