N=int(input())

def prime_factorization(n):
    arr=[]
    temp=n

    for i in range(2,int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp//=i
            arr.append([i,cnt])

    if temp!=1:
        arr.append([temp,1])
    
    if arr==[]:
        arr.append([n,1])
    
    return arr

def solve():
    if N==1:
        print("Yes")
        return
    
    pri=prime_factorization(N)

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

        

solve()