#include <bits/stdc++.h>
#define int long long
using namespace::std;

bool countDivisors(int n)
{
    vector<pair<int, int>> factors;
    for (int i = 2; i * i <= n; i++) {
        int count = 0;
        while (n % i == 0) {
            n /= i;
            count++;
        }
        if (count > 0) factors.push_back({i, count});
    }
    if (n > 1) factors.push_back({n, 1});

    if(factors.size() == 1 && factors[0].second % 2 == 1) return true;
    else {
        for(pair<int, int> e: factors) {
            if(e.second > 1) return false;
        }
    }
    return true;
}
int32_t main() {
    int N; cin >> N;
    if (N != 1 && countDivisors(N)) cout << "Y\n";
    else cout << "N\n";
    return 0;
}