#include using namespace std; using ll = long long; using ld = long double; #define mod99 998244353 #define mod107 1000000007 #define endl "\n" #define rep(i,n) for (ll i = 0; i < (ll)(n); ++i) #define prep(i,a,n) for (ll i = a; i < n; ++i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(), a.rend() #define si(x) ((ll)(x).size()) #define YN(bool) if(bool){cout<<"YES"< inline T gcd(T a,T b) {return (b==0)?a:gcd(b,a%b);} template inline T lcm(T a, T b) {return a/gcd(a,b)*b;} #define sq(x) ((x)*(x)) #define cube(x) ((x)*(x)*(x)) const ld PI=3.141592653589793238462643383279; const ll INF=1000000000000000000LL; string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; string abc = "abcdefghijklmnopqrstuvwxyz"; #define next_p next_permutation bool isprime(ll N){ if(N<2) return false; for(ll i=2; i*i<=N; i++) if(N%i==0) return false; return true; } vector> p_div(ll n) { vector> ret; for(ll a=2;a*a<=n;a++) { if(n%a!=0) continue; ll e=0; while(n%a==0) {e++;n/=a;} ret.push_back({a,e}); } if(n!=1) ret.push_back({n,1}); return ret; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll x;cin >> x; yn(x==0); }