#include <cstdio>
#include <cmath>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <bitset>
#include <map>
#include <cstring>
#include <algorithm>

#define NMAX 50003

using namespace std;

FILE* fin, * fout;

int a, mod;

long long int putere(long long baza,long long put)
{
	long long int sol = 1;
	while (put > 0)
	{
		if (put % 2 == 1)
		{
			sol *= baza;
			sol %= mod;
		}
		baza = (baza * baza)%mod;
		put /= 2;
	}
	return sol;
}

int nrNumerePrime(int nr)
{
	//calculez phi din asta(nr numere prime relativ la numarul meu)
	long long int sol = nr;
	for (int i = 2; i * i <= nr; i++)
	{
		if (nr % i == 0)
		{
			sol = sol * (i - 1) / i;
			while (nr % i == 0)
			{
				nr /= i;
			}
		}
	}
	if (nr > 1)
	{
		sol = sol * (nr - 1) /nr;
	}
	return sol;
}

int main()
{
	fin = fopen("inversmodular.in", "r");
	fout = fopen("inversmodular.out", "w");
	
	fscanf(fin, "%d %d", &a,&mod);
	fprintf(fout, "%lld", putere(a, nrNumerePrime(mod)-1));
	return 0;
}