#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

YES = 'Yes'
NO = 'No'


def factorize(N):
    i = 2
    ans = dict()
    n = N
    # while i * i <= N:
    while i * i <= n:

        while n % i == 0:
            n //= i
            if i in ans:
                ans[i] += 1
            else:
                ans[i] = 1
        i += 1
    if n != 1:
        ans[n] = 1
    return list(ans.items())

def solve(N):
    fact = factorize(N)
    if len(fact) <= 2:
        return 'Yes'
    return 'No'

N = int(input())
print(solve(N))