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.
from math import sqrt
n = int(input())
primas=[]

def prima(n):
    for i in range(2,int(n/2)+1):
        divisor=2
        prime=True
        while(divisor<int(sqrt(i))+1):
            if(i%divisor==0):
                prime=False
                break
            divisor+=1
        if(prime):
            primas.append(i)

prima(n+10)
if n in primas:
    print('NO')
else:
    print('YES')