#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int p[8] = {2, 3, 5, 7, 11, 13, 17, 19};
int fpow(ll a, ll b, ll mod)
{
    ll ans = 1;
    while (b)
    {
        if (b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

bool judge(ll x)
{
    ll t = x - 1; int k = 0;
    while (!(t & 1)) k++, t >>= 1;
    for (int i = 0; i < 8; i++)
    {
        if (x == p[i]) return true;
        ll tmp = fpow(p[i], t, x);
        for (int j = 1; j <= k; j++)
        {
            int nxt = tmp * tmp % x;
            if (nxt == 1 && tmp != 1 && tmp != x - 1) return false;
            tmp = nxt;
        }
        if (tmp != 1) return false;
    }
    return true;
}

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

    ll x;
    while (~scanf("%lld", &x))
    {
        if (x == 1) { cout << "N\n"; continue; }
        cout << (judge(x) ? "Y\n" : "N\n");
    }
    return 0;
}