Existence of an Integer with Greater Prime Factor Count

Let (f(x)) be defined as the sum of the exponents in the prime factorization of (x). In other words, if (x) can be written as (x = p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}), where (p_1, p_2, \ldots, p_k) are distinct primes, then [ f(x) = a_1 + a_2 + \cdots + a_k. ]

Given an integer (n), determine whether there exists an integer (m) with (1 < m < n) such that (f(m) > f(n)). If such an (m) exists, output Yes; otherwise, output No.

inputFormat

The input consists of a single integer (n) on a single line.

outputFormat

Output a single line containing Yes if there exists an integer (m) with (1 < m < n) such that (f(m) > f(n)), and No otherwise.

sample

6

No