def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct

n = int(input())

if n == 1:
    print('NO')
    exit()

fac = factorize(n)

if len(fac) >= 3:
    print('YES')
elif len(fac) == 2:
    if fac[0][1] >= 2 or fac[1][1] >= 2:
        print('YES')
    else:
        print('NO')
else:
    if fac[0][1] >= 2:
        if fac[0][1] == 2 and fac[0][0]**fac[0][1] == n:
            print('NO')
        else:
            print('YES')
    else:
        print('NO')