import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math, std.typecons;


void main() {
    int n;
    scan(n);

    int top = 10^^9, btm = 0;

    int calc(int k) {
        int res = 0;

        while (k > 0) {
            res += k;
            k /= 2;
        }

        return res;
    }

    while (top - btm > 1) {
        int mid = (top + btm) / 2;

        if (calc(mid) <= n) {
            btm = mid;
        }
        else {
            top = mid;
        }
    }

    writeln(calc(btm) == n ? "YES" : "NO");
}





void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}