n = int(input())

def prime_factorize(n):
    i = 2
    temp = n
    result = []
    while(i * i <= n):
        count = 0
        while temp % i == 0:
            count += 1
            temp //= i
        if count > 0:
            result.append([i, count])
        i += 1
    if temp != 1:
        result.append([temp, 1])
    return result

factorize = prime_factorize(n)

ok = False

if len(factorize) == 0:
    ok = False
elif len(factorize) >= 3:
    ok = True
elif len(factorize) == 2:
    if factorize[0][1] >= 2 or factorize[1][1] >= 2:
        ok = True
else:
    if factorize[0][1] > 2:
        ok = True
if ok:
    print('YES')
else:
    print('NO')