import math

N = int(input())

def is_prime(n):
    i = 2
    result = []
    M = n
    while i <= math.sqrt(n):
        if n % i == 0:
            result.append(i)
            if len(result) >= 2:
                if result[0] * result[1] < M:
                    return 'YES'
                else:
                    return 'NO'

            n = n // i
        elif n % i > 0:
            i += 1
    return 'NO'

print(is_prime(N))