#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll pw(ll a, ll x,ll mod){
	ll ret = 1;
	while(x){
		while(!(x&1)){
			(a *= a) %= mod;
			x /= 2;
		}
		(ret *= a) %= mod;
		x--;
	}
	return ret;
}
vector<ll> v;
int main(){
	ll i,p,n;
	cin >> p >> n;
	for(i=1;i*i<=p - 1;i++){
		if((p - 1)%i==0){
			v.push_back(i);
			if(i*i!=p-1){
				v.push_back((p - 1)/i);
			}
		}
	}
	if(n==1){
		cout << 0 << endl;
		return 0;
	}
	sort(v.begin(),v.end());
	ll j = -1;
	for(i=0;i<v.size();i++){
		if(v[i]==1) continue;
		if(pw(n,v[i],p)==1){
			j = v[i];
			break;
		}
	}
	int x = (p - 1)/j;
	cout << (x&1) << endl;
}