#define DEBUG 1
#include <bits/stdc++.h>
#define loop(n) for (lint ngtkana_is_a_genius = 0; ngtkana_is_a_genius < lint(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (lint i = lint(begin); (i) < lint(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto&& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto&& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#if DEBUG
#define debug(...)\
    do {\
        std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
        debug_impl(__VA_ARGS__);\
        std::cerr << std::noboolalpha;\
    } while (false)
#else
#define debug(...) {}
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
    { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
    for (auto it = v.begin(); it != v.end(); it++)
        {os << (it != v.begin() ? "," : "") << *it;}
    return os << "}";
}

lint f(lint a, lint p) {
    if(p==2)return +1;
    a%=p;
    if(a==1)return +1;
    if(a==2){
        return (p*p-1)/8%2?-1:+1;
    }
    std::vector<int>primes;
    for(lint q=2;q*q<=a;q++){
        while(a%q==0){
            primes.push_back(q);
            a/=q;
        }
    }
    if(1<a){
        primes.push_back(a);
        a/=a;
    }
    if(primes.size()==1u){
        int q=primes.at(0);
        return f(p,q)*((p-1)*(q-1)/4%2?-1:+1);
    }
    int ans=1;
    for(int q:primes){
        ans*=f(q,p);
    }
    return ans;
};

int main() {
    std::cin.tie(0); std::cin.sync_with_stdio(false);
    lint P, N; std::cin >> P >> N;
    lint ans=f(N,P);
    std::cout << (ans==+1?0:1) << std::endl;
    return 0;
}