#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define f first
#define s second
#define lep(i,a,b) for (int i=(a); i <= (b); i++)
#define rep(i,b,a) for (int i = (b); i >= (a); i--)

map<int,int> factorize(int n) {
    map<int,int> res;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            while (n % i == 0) {
                n /= i;
                res[i]++;
            }
        }
    }
    if (n > 1) res[n]++;
    return res;
}

void yay() {
    cout << "Y\n";
}

void gg() {
    cout << "N\n";
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    map<int,int> res = factorize(n);
    if ((int)res.size() == 1 and res.begin()->s == 1) {
        yay();
    } else if ((int)res.size() == 2) {
        bool ok = true;
        for (pi p: res) {
            if (p.s > 1) ok = false;
        }
        if (ok) {
            yay();
        } else {
            gg();
        }
    } else {
        gg();
    }

}