Reciprocal List Sum

You are given a positive integer N. Your task is to determine whether it is possible to construct a list of N positive integers such that the sum of their reciprocals is exactly 1.

Mathematically, you need to check if there exist positive integers \(a_1, a_2, \ldots, a_N\) satisfying:

\(\frac{1}{a_1} + \frac{1}{a_2} + \cdots + \frac{1}{a_N} = 1\)

For example, when N = 2, one possible solution is \(a_1 = 2\) and \(a_2 = 2\) because \(\frac{1}{2} + \frac{1}{2} = 1\).

If N is greater than 1, it is always possible to construct such a list. Otherwise, if N = 1, it is impossible.

inputFormat

The input consists of a single line containing one integer N (1 ≤ N ≤ 10⁶).

outputFormat

Output a single line containing Yes if it is possible to construct such a list, and No otherwise.

1

No