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.
import math
import queue

from itertools import permutations


n=int(input())

a=[]
checked=0
current=0

for i in range(0,n):
    a.append(1)


for i in range(0,n*n+1):
    checked+=a[current]
    a[current]=0
    
    current+=(i+1)
    current=current%n
    
if checked==n:
    print("YES")

else:
    print("NO")
    