Binary Palindrome Checker

You are given an integer \(n\) satisfying \(1 \le n \le 10000\). Your task is to determine whether the binary representation of \(n\) is a palindrome. In other words, if we represent \(n\) in base \(2\) (without leading zeros), check if the resulting string reads the same forwards and backwards.

For example, for \(n = 9\), its binary representation is "1001", which is a palindrome. Whereas for \(n = 10\), the binary representation is "1010", which is not a palindrome.

inputFormat

The input consists of a single integer \(n\) (\(1 \le n \le 10000\)) given in one line from standard input.

outputFormat

Output a single line containing either "Yes" if the binary representation of \(n\) is a palindrome or "No" otherwise.

9

Yes