fac = {}


def prime_factorization(n):
    i = 2
    while i * i <= n:
        while not n % i:
            fac[i] = fac.get(i, 0) + 1
            n //= i
        i += 1

    if n != 1:
        fac[n] = 1


def main():
    n = int(input())

    prime_factorization(n)

    if 3 <= len(fac):
        print("YES")
        exit()
    elif len(fac) == 2:
        k1, v1 = fac.popitem()
        k2, v2 = fac.popitem()
        if 1 < v1 or 1 < v2:
            print("YES")
            exit()
    elif len(fac):
        k, v = fac.popitem()
        if 2 < v:
            print("YES")
            exit()

    print("NO")


if __name__ == '__main__':
    main()