// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using lg = long long;
using pii = pair<int, int>;
using pll = pair<lg, lg>;
#define TEST cerr << "TEST" << endl
#define IINF 2147483647
#define LLINF 9223372036854775807LL
#define AMARI 998244353
// #define AMARI 1000000007
#define TEMOTO ((sizeof(long double) == 16) ? false : true)
#define TIME_LIMIT 1980 * (TEMOTO ? 1 : 1000)
#define el '\n'
#define El '\n'


//素数列挙等も含まれている
vector<long long> ococo_soinsuubuncai(long long a) {
    int sa = sqrt(a);
    vector<long long> ans(0);
    vector<bool> plist(sa + 1, true);
    plist[0] = false; plist[1] = false;
    for (int i = 2; i <= sa; i++) {
        if (plist[i] == true) {
            for (int j = 2 * i; j <= sa; j += i)plist[j] = false;
        }
    }
    int pp = 2;
    for (int i = pp; i <= sa; i++) {
        if (plist[i] && a % i == 0) {
            ans.push_back(i);
            a /= i;
            i--;
        }
    }
    if (a != 1)ans.push_back(a);
    return ans;
}

#define MULTI_TEST_CASE false
void solve(void) {
    lg n;
    cin >> n;
    vector<lg> v = ococo_soinsuubuncai(n);
    set<lg> st;
    for(int i = 0; i < v.size(); i++)st.insert(v[i]);
    if(st.size() <= 2)cout << "Yes" << el;
    else cout << "No" << el;
    return;
}

void calc(void) {
    return;
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if (MULTI_TEST_CASE) cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}