#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

int main(){
    ll N;
    cin >> N;

    map<int, int> P;
    for (ll n = 2; n*n <= N; n++){
        while (N%n == 0) P[n]++, N /= n;
    }
    if (N > 1) P[N]++;

    int mu = 1;
    for (auto [_, v] : P){
        if (v == 1) mu *= -1;
        else mu = 0;
    }
    cout << mu << endl;
}