#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	ll n; cin >> n;
	vector<pii> V;
	for(int i = 2; (ll)i * i <= n; ++i)
	{
		if(n % i == 0)
		{
			int cnt = 0;
			while(n % i == 0) n /= i, ++cnt;
			V.push_back({i, cnt});
		}
	}
	if(n > 1) V.push_back({n, 1});

	if((V.size() == 1 && V[0].ss % 2 == 1) || V.size() == 2) cout << "Y";
	else cout << "N";
}