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.
#!/usr/bin/env python
# coding=utf-8
'''
Author: Deean
Date: 2021-11-28 16:14:20
LastEditTime: 2021-11-28 16:16:34
Description: Flea travel
FilePath: CF55A.py
'''


def func():
    n = int(input())
    if bin(n).count("1") == 1:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    func()
