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())

m=1
p=1
s = { 1 }
while( 1 ):
	if (m%n==1 and p==1) or len(s)==n:
		break
	p = ( p+(m) )%n
	s.add(p)
	m+=1
	print( s )
	
if len(s)==n:
	print("YES")
else:
	print("NO")
