#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
ll mod;
ll n, k, m, mi, ma;

ll lpow(ll x, ll p){
	cout << p << "\n";
	if(p == 0) return 1;
	ll f = lpow(x, p/2);
	f = (f*f)%mod;
	if(p%2) f = (f*x)%mod;
	return f;
}

void solve(){
	
	ifstream cin("inversmodular.in");
	ofstream cout("inversmodular.out");
	
	cin >> m >> n;
	mod = n;
	ll p = 1;
	k = n;
	for(int i = 2; i*i<=k; i++){
		if(k%i) continue;
		p *= i - 1;
		k /= i;
		while(k%i == 0){
			k/=i;
			p*=i;
		}
	}
	if(k > 1) p *= k - 1;
	p--;
	cout << lpow(m, p) << "\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t=1;
//	cin >> t;
	while(t--) solve();
	
	return 0;
}