#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll n; cin >> n;
    // k * (k + 1) / 2 = n
    ll L = 0, R = 1e10;
    auto f = [n](ll x){ return x * (x + 1) / 2 <= n; };
    while(R - L > 1) {
        ll M = (L + R) / 2;
        (f(M) ? L : R) = M;
    }
    if(L * (L + 1) / 2 == n) {
        cout << "Yes\n" << L << endl;
    } else {
        cout << "No" << endl;
    }
}