Consecutive Sum Representation

Given a positive integer \( n \), determine whether it can be expressed as the sum of two or more consecutive positive integers. Mathematically, a number can be represented in this way if and only if it is not a power of 2. In other words, if \( n \) is a power of 2 then it cannot be expressed as such a sum; otherwise, it can be.

For example, \(15 = 4 + 5 + 6\) and \(21 = 10 + 11\) are valid representations.

inputFormat

The input contains a single integer \( n \) provided via standard input (stdin).

outputFormat

Output a single word: YES if \( n \) can be expressed as the sum of two or more consecutive positive integers, or NO otherwise. The output should be written to standard output (stdout).

15

YES