//Ya to win hai ya learn hai 2.0

#include <bits/stdc++.h>
#include <algorithm>
#define int long long
using namespace std;
#define fastnuces ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);int t = 1;

bool isprime(int a)
{
  for(int i=2;i<sqrt(a);i++)
  {
    if(a%i==0)
    {
      return false;
    }
  }
  return true;
}
bool check(int a)
{
  int prime=2;int check;
  while(true)
  {
      check=log(a)/log(prime);
    if(check==(log(a)/log(prime)))
    {
      return true;
    }
    else
    {
      while(true)
      {
        bool check=isprime(++prime);
        if(check==true)
        {
          break;
        }
      }
    }
    if(prime>a)
    {
      return false;
    }
  }
}

void solve()
{
  int n;int prime=2;cin>>n;
  for(int i=1;i<=sqrt(n);i++)
  {
    if((n/i)*i==n)
    {
      if(check(n/i)==true && check(i)==true)
      {
        cout<<"Yes";return;
      }
    }
  }
  cout<<"No";
}  

signed main() {
    fastnuces;
    //cin>>t;
    while (t--) {
        solve();
        cout<<endl;
    }
    return 0;
}