#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast","inline")
typedef long long ll;
#define pll pair<ll, ll>
ll N;
ll base[7] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};

ll power(__int128 a, ll b, ll m)
{
    ll ans = 1;
    a %= m;
    while (b)
    {
        if (b & 1)
            ans = ans * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return ans;
}

bool Miller_Rabin(ll n)
{ // 判断素数
    if (n == 2)
        return true; // 2是素数
    if (n < 2 || !(n & 1))
        return false; // 如果x是偶数或者是0，1，那它不是素数
    ll u = n - 1, k = 0;
    while (!(u & 1))
    {
        k++;
        u >>= 1;
    }
    for (auto it : base)
    {
        if (it % n == 0)
            continue;
        ll v = power(it, u, n);
        if (v == 1 || v == n - 1)
            continue;
        for (int j = 1; j <= k; j++)
        {
            ll last = v;
            v = (__int128)v * v % n;
            if (v == 1)
            {
                if (last != n - 1)
                    return false;
                break;
            }
        }
        if (v != 1)
            return false; // 用费马小定理判断
    }
    return true; // 如果进行多次测试都是对的，那么x就很有可能是素数
}
void solve()
{
    ll x;
    while (cin >> x)
    {
        if (Miller_Rabin(x))
            cout << "Y\n";
        else
            cout << "N\n";
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}