#include <bits/stdc++.h>
#include <iterator>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 1
using ll = long long;
using ld = long double;
const int mod = 998244353;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

void Div_Prime(ll n, vector<ll> &prime) {
	for (int i = 2; i <= sqrt(n); i++) {
		if (n % i == 0) {
			prime.push_back(i);
			while (n % i == 0) {
				n /= i;
			}
		}
	}
	if (n != 1) {
		prime.push_back(n);
	}
}

int main() {
	ll N;
	cin >> N;
	vector<ll> prime;

	Div_Prime(N, prime);

	if (prime.size() <= 2) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}