#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    if (n == 1) {
        cout << "N" << endl;
        return 0;
    }
    vector<ll> p;
    for (ll i = 2; i*i <= n; ++i) {
        while (n%i == 0) {
            p.push_back(i);
            n /= i;
        }
    }
    if (n > 1) p.push_back(n);
    if (p.size() <= 1 or (p.size() == 2 and p[0] == p[1])) {
        cout << "N" << endl;
    }
    else {
        cout << "Y" << endl;
    }
}