#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int N = 1e6+10;
int t,n,m,k,l,r,op,x,y;
int f[N];
bool flag ;
void solve(){
    while(cin>>n){
        flag = false;
        for(int i =2;i*i<=n;i++){
            if((n%i==0)&&(n/i)*(n/i)%n==0){
                flag = true;
                break;
            }
        }
        if(flag){
            cout<<"Yes";
        }else{
            cout<<"No";
        }
        cout<<"\n";
    }
}
//2 3 4 6


//k**2%n==0
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);  
    solve();
    return 0;
}