#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
///#define cin fin
///#define cout fout
using namespace std;

const int mod=1e9+7;

int a,n;

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

int lgp(int a,int b){
    if(b==0) return 1;
    else if(b==1) return a%n;
    else{
        int cc=(lgp(a,b/2)%n);
        if(b%2==1) return (cc%n)*(cc%n)*(a%n);
        else return (cc%n)*(cc%n);
    }
}

int32_t main(){
	//ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("inversmodular.in");
    ofstream fout("inversmodular.out");
    fin >> a >> n;
    fout << lgp(a,phi(n)-1)%n;
}