#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
typedef long long LL;
#define all(x) ((x).begin()), ((x).end())
#define pb push_back
int main() {
    LL n;
    cin >> n;
    int cnt = 0;
    vector<LL> vec, cev;
    for(LL i = 1; i * i <= n; i++) {
        if(n % i == 0) {
            cnt++;
            vec.pb(i);
            if(i != n / i) {
                cnt++;
                cev.pb(n / i);
            }
        }
    }
    reverse(all(cev));
    vec.insert(vec.end(), all(cev));
    if(cnt % 2 == 0) {
        bool is_power = true;
        for(int i = 2; i < (int)vec.size(); i++) {
            if(vec[i] % vec[i - 1] == 0 && vec[i] / vec[i - 1] == vec[1]) {

            } else {
                is_power = false;
                break;
            }
        }
        if(is_power || cnt == 4) {
            printf("Y\n");
            exit(0);
        }
    }
    printf("N\n");
}