#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

int main(){
  lint n;
  cin>>n;
  lint p=2e9,f=0;
  while(p-f>1){
    lint x=(p+f)/2;
    if(x*(x+1)>=2*n)p=x;
    else f=x;
  }
  if(p*(p+1)==2*n){
    cout<<"YES\n"<<p<<endl;
  }else{
    cout<<"NO\n";
  }
}