#include <bits/stdc++.h>
using namespace std;
long long mod;
int invmod(long long a,long long b)
{
    if (b==0) return 1;
    else if (b==1) return a;
    else if (b%2==0) return (invmod(a*a,b/2))%mod;
    else return (a*(invmod(a*a,(b-1)/2)))%mod;
}
int main()
{
    ifstream cin("inversmodular.in");
    ofstream cout("inversmodular.out");
    long long a,n,x;
    cin>>a>>n;
    mod=n;
    x=invmod(a,n-2);
    cout<<x%mod;
}