#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "inversmodular";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

int MOD;

int expLog(int B, int E) {
    int i, ans = 1;

    for(i = E; i; i /= 2) {
        if(i & 1)
            ans = (ans * 1LL * B) % MOD;
        B = (B * 1LL * B) % MOD;
    }

    return ans;
}

int phi(int x) {
    int i, ans = x;

    for(i = 2; i * i <= x; i++)
        if(x % i == 0) {
            ans = ans / i * (i - 1);

            while(x % i == 0)
                x /= i;
        }

    if(x > 1)
        ans = ans / x * (x - 1);

    return ans;
}

int invMod(int x) {
    return expLog(x, phi(MOD) - 1);
}

int main() {
    int x;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &x, &MOD);

    printf("%d\n", invMod(x));

    return 0;
}