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.
quant = int(input())
pos = 1
positions = list(range(1,quant+1))
print(positions)
for i in range(1,quant*2):
    pos+= i-1
    if pos in positions:
        positions.remove(pos)
if len(positions) == 0:
    print('YES')
else:
    print('NO')
    
#https://codeforces.com/contest/55/problem/A