#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;

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

	long long l = 1, r = 1.5*sqrt(n);

	long long m;
	while (l < r) {
		m = (l + r) / 2;

		if (m*(m + 1)/2 + (m*(m + 1)) % 2 < n)l = m + 1;
		else r = m;
	}

	if (l*(l + 1)/2 + (l*(l+1))%2 == n) {
		cout << "YES" << endl;
		cout << l << endl;
	}
	else cout << "NO" << endl;

	return 0;
}