#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <map>
#include <numeric>
#include <random>
#include <queue>
#include <deque>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <functional>

using namespace std;
typedef long long ll;

const int INF = (1 << 30) - 1;
const ll INFLL= (1LL << 61) - 1;
const int MOD = 1000000007;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll N;
  cin>>N;

  int ok=N,ng=-1;
  bool ans=false;
  int mid;
  while(ok-ng>1){
    mid=(ok+ng)/2;
    bool flag=(mid*(mid+1)/2>N);
    if(mid*(mid+1)/2==N){
      ans=true;
      break;
    }
    if(flag){
      ok=mid;
    }else{
      ng=mid;
    }
  }
  if(ans)cout<<"YES"<<endl<<mid<<endl;
  else cout<<"NO"<<endl;
}