#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

int main() {

	unsigned long long n = 0, ans = 0;
	;
	cin >> n;
	ans = n;

	n *= 2;

	unsigned long long k = sqrt(n);

	for (ll i = k + 1; i >= 1; i--) {
		if (i * (i + 1) == n) {
			cout << "YES" << endl;
			cout << i << endl;
			return 0;
		}
		if (i * (i + 1) < n) {
			cout << "NO" << endl;
			return 0;
		}
	}

	return 0;
}