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


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

    long btm = 0, top = n;

    bool check(long m) {
        return m >= (2*n + m) / (m + 1);
    }

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

        if (check(mid)) {
            top = mid;
        }
        else {
            btm = mid;
        }
    }

    if (top*(top+1)/2 == n) {
        writeln("YES");
        writeln(top);
    }
    else {
        writeln("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);
        }
    }
}