#include <bits/stdc++.h>
using namespace std;

#define vi vector<int>
#define vs vector<string>
#define int long long int
#define pii pair<int,int>
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define ff first
#define s second
#define nl cout<<endl;
#define print(a) cout<<a<<"\n";
#define all(a) (a).begin(), (a).end()
#define parr(a) f(mnb,0,a.size()){cout<<a[mnb]<<" ";}cout<<endl;
#define rarr(a) f(yon,0,a.size()){cin>>a[yon];}
#define imx INT_MAX
#define imn INT_MIN
#define sortD(a) sort(a.end(),a.begin());
#define sortA(a) sort(all(a));



void solve(){
    int n; cin >> n;
    if(n == 1){
        cout << "Yes";
        return;
    }
    set<int> st;
    
    auto findprime = [&](){
    
        while(n%2==0){
               st.insert(2);
                //pf.pb(2);
                n/=2;
            }
        for(int i =3;i*i<=n;i+=2){
            if(n%i==0){
                st.insert(i);
                //pf.pb(i);
                n/=i;
            }
        }
        if(n>2) 
        st.insert(n);
           // pf.pb(n);
    };

    findprime();
   // parr(pf)
    cout << (st.size() == 1 || st.size() == 2?"Yes":"No");

}



signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t=1;
		//cin>>t;
	while(t--){
		solve();
	}
}