//PLEASE GOD MAKE THIS CODE ACCEPTED SOLUTION
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define forn(i,a,n) for(int i = a; i<n; i++)
#define fornr(i,a,n) for(int i = n-1; i>=a; i--)
#define print(a) cout<<a<<"\n";
#define printarr(a)                 \
    forn(i,0,a.size()) cout<<a[i]<<" ";\
    cout<<endl;
 
#define pb push_back
#define all(a) a.begin(), a.end()
#define sorted(a) is_sorted(all(a))
#define vi vector<int>
#define vc vector<char>
#define vd vector<double>
#define vs vector<string>
#define vb vector<bool>
#define vpib vector<pair<int,bool>>
#define vpis vector<pair<int,string>>
#define vpii vector<pair<int,int>>
#define vpic vector<pair<int,char>>
#define vvi vector<vector<int>>
#define vpss vector<pair<string,string>>
#define vvc vector<vector<char>>

const ll MOD = 1e9 + 7;

set<int> st;

void factorize(ll n) {
    int count = 0;
    while (n % 2 == 0) {
        n >>= 1;
        count++;
    }
    if (count){ st.insert(2); st.insert(count);}

    for (ll i = 3; i * i <= n; i += 2) {
        count = 0;
        while (n % i == 0) {
            count++;
            n /= i;
        }
        if (count) { st.insert(count); st.insert(i); }
    }

    if (n > 1) st.insert(n);
}

void solve(){
    int n;
    cin>>n;
    factorize(n);
    // for (auto it : st) {
    //     cout<<it<<' ';
    // }
    cout<<endl;
    if(st.size()==2){
        cout<<"Yes"<<endl;
        return;
    } else if(st.size()==3 && st.find(2)!=st.end()){
        cout<<"Yes"<<endl;
        return;
    }
    cout<<"No"<<endl;
} 

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
}