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())
c=[]
for i in range(1,n+1):
    c.append(i)
pos=1
for i in range(1,n+1):
    if pos>n:
        pos=pos-n
        if pos in c:
            c.remove(pos)
    else:
        if pos in c:
            c.remove(pos)
if len(c)==0:
    print("YES")
else:
    print("NO")