from sys import stdin
from itertools import compress, count
readline = stdin.readline


def sieve(n):
    p = [1] * (n + 1)
    p[0] = p[1] = 0

    for i in range(int(n ** 0.5) + 1):
        if p[i]:
            for j in range(2 * i, len(p), i):
                p[j] = 0
    return p


def isnotprime(n):
    p = sieve(int(n ** 0.5))

    for i in compress(count(), p):
        if n % i == 0:
            return True
    return False


def solve(n):
    print('YES' if isnotprime(n) else 'NO')


def main():
    n = int(readline())
    solve(n)
main()