from collections import deque,defaultdict
from itertools import permutations
from functools import cmp_to_key
import math,sys,heapq,random,bisect,copy
def LMI() : return list(map(int,input().split()))
def LMS() : return list(map(str,input().split()))
def MI() : return map(int,input().split())
def LLI(N) : return [LMI() for _ in range(N)]
def LLS(N): return [LMS() for _ in range(N)]
def LS(N) : return [input() for _ in range(N)]
def LI(N) : return [int(input()) for _ in range(N)]
def II() : return int(input())


#入力
def Prime(N):
    soinsuu=defaultdict(int)
    LIMIT=int(N**0.5)
    i=2
    n=N
    while i<=int(n**0.5):
        if n%i==0:
            soinsuu[i]+=1
            n//=i
        else:
            i+=1
    if n!=1:
        soinsuu[n]+=1

    return soinsuu
N=II()
a=Prime(N)
if len(a.keys())<=2:
    print('Yes')
else:
    print('No')