#K79412. Powerful Number Check

    ID: 35303 Type: Default 1000ms 256MiB

Powerful Number Check

Powerful Number Check

A positive integer \( n \) is considered powerful if it can be represented as the sum of two or more consecutive positive integers. In mathematical terms, there exist integers \( a \ge 1 \) and \( k \ge 2 \) such that

[ n = a + (a+1) + \cdots + (a+k-1) = k,a + \frac{k(k-1)}{2} ]

Your task is to determine whether the given number is powerful. Print Yes if it is powerful, and No otherwise. Note that powers of two (including \(1\)) cannot be written as a sum of two or more consecutive positive integers.

inputFormat

The input consists of a single positive integer \( n \) read from standard input.

outputFormat

Output a single line containing either Yes if the number is powerful or No otherwise.

## sample
15
Yes