def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


n = int(input())
a = prime_factorize(n)
d = {}
for e in a:
    d[e] = d.get(e, 0) + 1
if len(d) <= 2:
    print("Yes")
else:
    print("No")