远端评测题 1000ms 256MiB

Flea travel

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Description

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.

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.

Samples

1
YES
3
NO

3.26 单人训练赛 时段2

未参加
状态
已结束
规则
ACM/ICPC
题目
13
开始于
2023-3-26 18:00
结束于
2023-3-26 23:00
持续时间
5 小时
主持人
参赛人数
16