#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
    {
        if (n % i == 0)
            return false;
    }

    return true;
}
int main()
{

    long long int n = 0;
    cin >> n;
    int count = 0;
    for (long long i = 2; i <= n; i++)
    {
        if (isPrime(i))
        {
            if (n % i == 0)
            {
                count++;
            }
        }
    }
    if (count > 2)
    {
        cout << "No" << endl;
    }
    else
    {
        cout << "Yes" << endl;
    }
}