def primelist(N):
    pr = []
    lpf = [0] * (N + 1)
    for d in range(2, N + 1):
        if lpf[d] == 0:
            lpf[d] = d
            pr.append(d)
        for p in pr:
            if p * d > N or p > lpf[d]:
                break
            lpf[p * d] = p
    return pr

N = int(input())
pr = primelist(10 ** 6)
cnt = 0
for p in pr:
    if N % p != 0:
        continue
    cnt += 1
    while N % p == 0:
        N //= p

if N != 1:
    cnt += 1

if cnt <= 2:
    print("Yes")
else:
    print("No")