#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
 
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};

vector<P>prime_factorize(ll n){
  vector<P> res;
  for(ll i=2;i*i<=n;i++){
    if(n%i!=0)continue;
    ll ex = 0;
    while(n%i==0){
      ++ex;
      n/=i;
    }
    res.emplace_back(i,ex);
  }
  if(n!=1)res.emplace_back(n,1);
  return res;
}
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  
  ll n;
  cin >> n;
  auto res=prime_factorize(n);
  bool ok = false;
  if(n%2==0 && res.size()>1)ok=true;
  for(auto p:res){
    if(p.second>1)ok=true;
  }
  if(ok)cout<<"YES"<<endl;
  else cout << "NO" << endl;
  return 0;
}