import bisect
import math


def mark(s, x):
    for i in range(x + x, len(s), x):
        s[i] = False


def sieve(n):
    s = [True] * n
    for x in range(2, int(n ** 0.5) + 1):
        if s[x]:
            mark(s, x)
    return [i for i in range(n) if s[i] and i > 1]


def solve():
    N = int(input())

    ps = sieve(int(math.sqrt(N)) + 1)
    ys = []
    i = 0
    while i < len(ps):
        p = ps[i]
        d, m = divmod(N, p)
        if m == 0:
            ys.append(p)
            N = d
            if len(ys) >= 3:
                return True
        else:
            i += 1
    if N > 1:
        ys.append(N)
    return len(ys) >= 3


def main():
    print('YES' if solve() else 'NO')


if __name__ == '__main__':
    main()