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

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

int main() {
    ll N;
    cin >> N;
    ll n = (sqrt(8LL*N+1)-1LL)/2LL;
    for (ll tmp = max(0LL, n-1000LL); tmp<=n+1000; ++tmp) {
        ll t1 = tmp, t2 = tmp+1;
        if (tmp%2 == 0) t1 /= 2LL;
        else t2 /= 2LL;
        if (t1*t2 == N) {
            cout << "YES" << endl;
            cout << (ll)tmp << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}