Binary Palindrome Checker

Given a non-negative integer n, determine whether its binary representation is a palindrome.

The binary representation is obtained by converting n into base 2 without any leading zeroes (except for 0 itself). A string is considered a palindrome if it reads the same backwards as forwards.

For example, when n = 9, its binary representation is 1001, which is a palindrome, so the answer is "yes". Conversely, when n = 10, the binary representation is 1010, which is not a palindrome, hence the answer should be "no".

Your task is to read the input from standard input (stdin) and write the output to standard output (stdout).

inputFormat

The input consists of one line containing a single non-negative integer n (0 ≤ n).

outputFormat

Output a single line containing the string "yes" if the binary representation of n is a palindrome, or "no" otherwise.

9

yes