#include <iostream>

using lint = long long;

void solve() {
    lint n;
    std::cin >> n;

    lint ok = 1LL << 31, ng = 0;
    while (ok - ng > 1) {
        lint mid = (ok + ng) / 2;

        if (mid * (mid + 1) / 2 >= n) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    if (ok * (ok + 1) / 2 == n) {
        std::cout << "YES" << std::endl
                  << ok << std::endl;
    } else {
        std::cout << "NO" << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}