import math

def sieve(n):
    limit = int(math.sqrt(n)) + 1
    is_prime = [True] * (limit + 1)
    primes = []
    is_prime[0] = is_prime[1] = False
    for i in range(2, limit + 1):
        if is_prime[i]:
            primes.append(i)
            for j in range(i * i, limit + 1, i):
                is_prime[j] = False
    return primes

def pfactors(n, primes):
    factors = []
    for p in primes:
        if p * p > n:
            break
        while n % p == 0:
            factors.append(p)
            n //= p
    if n > 1:
        factors.append(n)
    return len(set(factors))

def solve():
    n = int(input())
    primes = sieve(n)
    if pfactors(n, primes) <= 2:
        print("Yes")
    else:
        print("No")

solve()