#include <bits/stdc++.h>
#define pb push_back
#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound

using namespace std;

const int inf = 1e18;

void p(auto A){
	for(auto e : A)cout << e << ' ';
	cout << '\n';
}

void solve(){
	int n; cin >> n;
	vector<int>is_prime((int)1e6+5);
	for(int i = 2; i*i< is_prime.size(); i++)if(!is_prime[i]){
		for(int j = i*i; j< is_prime.size(); j+= i)is_prime[j] = 1;
	}
	
	//for(int i = 1; i<= 100; i++)if(!is_prime[i])cout << i << ' ';
	
	if(n == 1){
		cout << 'N';
			return;
	}
	
	int fl = 0;
	for(int i = 2; i*i<= n; i++)if(n%i==0){
		fl = 1;
		break;
	}
	if(!fl){
		cout << 'Y';
			return;
	}
	for(int i = 2; i*i<= n; i++)if(n%i==0 && is_prime[i] && is_prime[n/i]){
		cout << 'Y';
			return;
	}
	for(int i = 1; i*i<= n; i++){
		if(i*i == n){
			//cout << !(is_prime[i]) << ' ' << (i*i == n && !(is_prime[i])) << endl;
			cout << 'N';
			return;
		}
	}
	cout << 'Y';
}


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


//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);