CF55A.Flea travel

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

A 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$ hassoсks (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.

输入格式

The only line contains single integer: $1<=n<=1000$ — number of hassocks.

输出格式

Output "YES" if all the hassocks will be visited and "NO" otherwise.

输入输出样例

输入#1
```
1
```
输出#1
```
YES
```
输入#2
```
3
```
输出#2
```
NO
```

首页