CF55A.Flea travel

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.

一只跳蚤此刻正坐在围成一圈的 $n$ 个脚凳中的某一个上。在第 $k$ 分钟后，跳蚤顺时针跳过 $k-1$ 个脚凳。例如，在第一分钟后，跳蚤跳到相邻的脚凳上。你需要回答：跳蚤是否会访问所有脚凳？我们假设跳蚤有无限的时间进行这种跳跃。

The only line contains single integer: 1 ≤ n ≤ 1000 — number of hassocks.

唯一一行包含一个整数：$1 \leq n \leq 1000$ — 脚凳的数量。

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

如果所有软垫都会被访问，则输出 “YES”，否则输出 “NO”。