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.
i = int(input())
mods = [0] * i
k = 0
for j in range(i):
  k += j
  mods[k % i] = 1
if all(m == 1 for m in mods):
  print("YES")
else:
  print("NO")
