def resolve():
    import sys

    input = sys.stdin.readline
    n = int(input())
    print("Yes" if len(prime_factorization(n)) <= 2 else "No")


def prime_factorization(n: int) -> dict:
    from collections import defaultdict

    pf = defaultdict(int)
    for i in range(2, int(n**0.5) + 1):
        while n % i == 0:
            pf[i] += 1
            n //= i
    if n > 1:
        pf[n] = 1
    return pf


if __name__ == "__main__":
    resolve()