#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

bool isComposite(int n, int t) {
    int root = sqrt(n);
    if (n == 1) return false;
    FOR(i, 2, root+1) {
        if (n % i == 0) {
            if (t == 1) return true;
            if (isComposite(n/i, t+1)) return true;
        }
    }
    return false;
}

signed main()
{
    int N;
    cin >> N;
    cout << ((isComposite(N, 0)) ? "YES" : "NO") << endl;

    return 0;
}