N=int(input())
def prime_factorize(n):
    a = []
    while n % 2 == 0: n //= 2; a.append(2)
    f = 3
    while f * f <= n:
        if n % f == 0: n //= f; a.append(f)
        else: f += 2
    if n != 1: a.append(n)
    return a
A=prime_factorize(N)
if len(set(A))<=2:print("Yes")
else:print("No")