from collections import defaultdict


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


pf = prime_factorize(int(input()))
print("Yes" if (len(pf) == 2 and len(set(pf.values())) == 2) or len(pf) == 1 else "No")