#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = 0; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i+++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define in insert

const char nl = '\n';

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << x;}
void __print(const char *x) {cerr << x;}
void __print(const string &x) {cerr << x;}
void __print(bool x) {cerr << (x ? "true" : "false"); }

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << "< "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}

void __print() {cerr << "]\n";}
template<typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = [":; _print(x); cerr << "\e39m" << endl;
#else
#define dbg(x...)
#endif

void solve() {

}


int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	ll N; cin >> N;
	ll X = N;
	map<ll, int> mp;
	for (ll i = 2; i*i <= N; i++) {
		while (X % i == 0) {
			mp[i]++;
			X /= i;
		}
	}
	if (X > 1) mp[X]++;

	bool poss = false;
	if (sz(mp) == 2) {
		int x = mp.begin()->second;
		int y = next(mp.begin())->second;
		if (x == 1 && y == 1) poss = true;
	}
	if (sz(mp) == 1 && mp.begin()->second % 2 == 1) poss = true;

	cout << (poss ? 'Y' : 'N') << '\n';
	return 0;
}