#include <iostream>
#include <fstream>
#define LL long long
using namespace std;
LL n, a;
LL put(LL a, LL num)
{
    if(num == 0)
        return 1;
    else
    {
        LL aux = put(a, num / 2) % n;
        if(num % 2 == 0)
            return (aux % n* aux % n) % n;
        return ((aux % n * aux % n) % n) * a % n;
    }
}
LL phi(LL nr)
{
    LL num = nr;
    for(LL i = 2; i * i <= nr; ++i)
    {
        if (nr % i == 0)
        {
            while(nr % i == 0)
                nr /= i;
            num -= (num / i);
        }
    }
    if (nr != 1)
        num -= num / nr;
    return num;
}
int main()
{
    ifstream f("inversmodular.in");
    ofstream g("inversmodular.out");
    f >> a >> n;
    g << put(a, phi(n) - 1) % n;
    f.close();
    g.close();
    return 0;
}