Flea travel
题目描述
A. Flea travel
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputA flea is sitting at one of the n hassocks, arranged in a circle, at the moment. After minute number k the flea jumps through k-1 hassocks (clockwise). For example, after the first minute the flea jumps to the neighboring hassock. You should answer: will the flea visit all the hassocks or not. We assume that flea has infinitely much time for this jumping.
Input
The only line contains single integer: 1≤n≤1000 − number of hassocks.
Output
Output "YES" if all the hassocks will be visited and "NO" otherwise.
Examples
Input
1
Output
YES
Input
3
Output
NO
题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1141 题。保留原作者与原赛事署名。