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())
a = [None] + [0 for i in range(n)]
a[1] = 1
k = 1
c = 0
cur = 1
#print(a)
for i in range(1000):
    cur += k % n
    a[cur] = 1
    k += 1
if a.count(0) == 0:
    print("YES")
else:
    print("NO")
