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 poplib
import string
import math


def main_function():
    n = int(input())
    # n * (n + 1) // 2
    moves = (n * (n - 1)) // 2
    if moves % n == 0:
        print("NO")
    else:
        print("YES")


if __name__ == '__main__':
    main_function()