#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    if (n < 2)
    {
        return false;
    }
    if (n == 2)
    {
        return true;
    }
    for (int i = 2; i < n; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
    }
    return true;
}
int main()
{
    long long int n = 0;
    cin >> n;
    vector<long long> a = {2, 3, 5, 7};
    int i = 0;
    if (isPrime(n))
    {
        cout << "No" << endl;
    }
    else
    {
        //bool flag = 0;
        while (n>1)
        {
         if(i==4 && n>1){
             break;
         }   
           
            if (n % a[i] != 0)
            {
                i++;
            }
            else
            {
                n /= a[i];
            }
        }
        if(n==1){
            cout << "Yes" << endl;
        }
        else{
            cout << "No" << endl;
        }
        
    }
}