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())
l = [0 for _ in range(n)]

pos = 0
for i in range(2 * n + 1):
	pos += i
	if pos >= n:
		pos %= n
	l[pos] = 1

if len(set(l)) == 2:
	print('no')
else:
	print('yes')


