#include<iostream>
#include<cstdio>
using namespace std;
int n,m;

int modInverse(int a, int m)
{
    a %= m;
    for(int x = 1; x < m; x++)
        if((a*x) % m == 1)
            return x;
}

int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%d%d",&n,&m);
    printf("%d\n",modInverse(n,m));
    return 0;
}