#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
ll mod = 1e9 + 7;
bool isPrime(ll x) {
    int i;
    if (x < 2)return 0;
    else if (x == 2) return 1;
    if (x % 2 == 0) return 0;
    for (i = 3; i * i <= x; i += 2) if (x % i == 0) return 0;
    return 1;
}
int main() {
    ll n; cin >> n;
    if (n == 1) cout << "NO" << endl;
    else if (isPrime(n)) cout << "NO" << endl;
    else {
        if (n % 2 == 0) {
            n /= 2;
            if (isPrime(n)) cout << "NO" << endl;
            else cout << "YES" << endl;
            return 0;
        }
        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) {
                if (isPrime(n / i)) cout << "NO" << endl;
                else cout << "YES" << endl;
                return 0;
            }
        }
    }
}