#include <fstream>
using namespace std;

int Factorial ( int num );

ifstream fin("gfact.in");
ofstream fout("gfact.out");
long long n, p;

int main()
{
	long long a = 1;
	fin >> n >> p;
	while ( p )
	{
		if( p % 2 )
		a =  a * n;
		n = n*n;
		p /= 2;
	}
	int nr;
	int i;
	for (  i = 1; i <= a; i++)
	{	
		if ( Factorial(i) % a == 0 )
		{	
			nr = i;
			break;
		}
	}
	fout << nr;
}

int Factorial (int num)
{
	if (num==1)
		return 1;
	return Factorial(num-1)*num; // recursive call
}