#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
*/

ll f(ll x)
{
  return x*(x+1)/2;
}

int main()
{
  ll n;
  cin >> n;

  ll ng = 0, ok = 2e9;
  while(ok - ng > 1){
    ll m = (ng + ok) / 2;
    if(n <= f(m)) ok = m;
    else ng = m;
  }

  if(f(ok) == n) printf("YES\n%lld\n", ok);
  else cout << "NO" << endl;

  return 0;
}