#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;
const double PI=acos(-1);


int main(){
    ll N;
    cin>>N;

    if(N==1){
        cout<<"No"<<endl;
        return 0;
    }

    vector<pair<ll,ll>> ans;
    for(ll p=2;p*p<=N;p++){
        if(N%p==0){
            pair<ll,ll> tmp;
            tmp.first=p;
            tmp.second=0;
            while(N%p==0){
                N/=p;
                tmp.second++;

            }
            ans.push_back(tmp);
        }
    }

    if(N>1){
        ans.push_back(make_pair(N,1));
        N/=N;
    }

    if(0<ans.size() && ans.size()<=2){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
}