#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define l(n) (n<<1)
#define r(n) ((n<<1)+1)
#define f(n) (n>>1)
#define lsb(a) (a&-a)
 
#include<vector>
#include<queue>
 
using namespace std;

#include<fstream>
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
 
const int NMAX = 105;
const int INF = 0x3f3f3f3f;
const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};
 
typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

int a,n;

int binexp(int a, int p, int n)
{
	int x=1;
	while(p)
	{
		if(p&1)
			x=(x*a)%n, p--;
		a=(a*a)%n;
		p/=2;
	}
	return x;
}

int phi(int n)
{
	int result=n;
	for(int i=2; i*i<=n; ++i)
	{
		if(n%i==0)
		{
			while(n%i==0)
				n/=i;
			result-=result/i;
		}
	}
	if(n>1)
		result-=result/n;
	return result;
}

int inv_modular(int a, int n)
{
	return binexp(a, phi(n)-1, n);
}

int main()
{
	cin>>a>>n;
	
	cout<<inv_modular(a,n);
	
	return 0;
}