from itertools import count


def calc_prime_factorize(num: int) -> dict[int, int]:
    if num < 2:
        raise ValueError

    divisors = {}
    for divisor in count(2):
        if divisor ** 2 > num:
            if num != 1:
                divisors[num] = 1
            break
        while num % divisor == 0 and num != 1:
            try:
                divisors[divisor] += 1
            except KeyError:
                divisors[divisor] = 1
            num //= divisor

    return divisors


def main():
    N = int(input())
    if N == 1:
        print("NO")
        return
    factors = calc_prime_factorize(N)

    match len(factors):
        case 0:
            raise ValueError
        case 1:
            if list(factors.values())[0] > 2:
                print("YES")
            else:
                print("NO")
        case 2:
            factors_num = set(factors.values())
            if len(factors_num) == 1 and factors_num.pop() == 1:
                print("NO")
            else:
                print("YES")

        case _:
            print("YES")


if __name__ == "__main__":
    main()