#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf = 1e10;


ll n;

bool C(ll mid){//index
    return mid*(mid+1)/2 <= n;
}

ll nibutan(){

    ll lb=-1,ub=2*1e9;

    while(ub-lb>1){
        int mid=(lb+ub)/2;
        if(C(mid)) lb=mid;
        else ub=mid;
        //cout<<lb<<" "<<ub<<endl;
    }
    return lb;
}

int main(){
    cin>>n;
    ll ans=nibutan();
    if(ans*(ans+1)/2!=n) p("NO");
    else{
        p("YES");
        p(ans);
    }

    return 0;
}