#include <stdio.h>

typedef long long ll;

ll mpow(ll x, ll n, ll p){   //x^n(mod p)
    ll ans = 1;
    while(n != 0){
        if(n&1) ans = ans*x % p;
        x = x*x % p;
        n = n >> 1;
    }
    return ans;
}

void solve()
{
    int p,n;
    scanf("%d%d", &p, &n);

    if(p==2) {
        printf("0\n");
    }
    else {
        if(mpow(n, (p-1)/2, p)==1) {
            printf("0\n");
        }
        else {
            printf("1\n");
        }
    }
    return;
}

int main(int argc, char* argv[])
{
    solve();
    return 0;
}