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.
n = int(input())
ans = [0] * n
ans[0] = 1

i = 0

for j in range(1, n):
    i = (i+j) % n
    ans[i] = 1
if sum(ans) == n:
    print('YES')
else:
    print("NO")