#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { ll n; cin >> n; ll l = 1; ll r = 2000000007; int cnt = 0; while(cnt < 100){ ll m = (l + r) / 2; if(m * (m + 1) / 2 == n){ cout << "YES" << endl; cout << m << endl; return 0; } if(m * (m + 1) / 2 < n){ l = m; }else{ r = m; } cnt++; } if(r * (r + 1) / 2 == n){ cout << "YES" << endl; cout << r << endl; return 0; } cout << "NO" << endl; return 0; }