#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define dme cout<<-1<<endl;return 0
//ios::sync_with_stdio(false);
//<< setprecision(5)
const int mod=1000000007;
const long double big=1e9+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
void small(llint n){
	llint m;cin>>m;
	llint mm=m;
	
	llint waru=1;//最大値
	for(llint i=2;i<100000;i++){
		llint now=1;
		while(m%i==0){m/=i;now*=i;}
		maxeq(waru,now);
	}
	maxeq(waru,m);
	m=mm;
	lldo ans=1;
	for(llint i=1;i<=n;i++){
		llint it=i;ans*=it;
		while((it%waru)==0){ans/=m;it/=waru;}
		
	}
	llint zyo=0;
	while(ans>=10){zyo++;ans/=10;}
	cout<<ans<<"e"<<zyo;
}
int main(void){
	lldo ans;//e^ans
	lldo n;cin>>n;
	if(n<100){small(n);return 0;}
	ans=(n+1.0/2)*log(n)-n+log(2*pai)/2;
	llint ni=n,gen;
	llint m;cin>>m;
	lldo lod=log((lldo)m);
	llint da=0;
	llint waru=1;//最大値
	for(llint i=2;i<100000;i++){
		llint now=1;
		while(m%i==0){m/=i;now*=i;}
		maxeq(waru,now);
	}
	maxeq(waru,m);
	while(ni>0){
		ni/=waru;
		da+=ni;
	}
	ans-=lod*da;
	ans*=log10(ena);
	llint sei=ans;
	cout<<exp((ans-sei)/log10(ena))<<"e"<<sei;
	return 0;
}