#include <bits/stdc++.h>

using namespace std;

long long int a,n,phi=1;

void gcd (long long &x, long long &y, int a ,int b)
{
    if (!b)
    {
        x=1;
        y=0;
    }
    else
    {
        gcd(x,y,b,a%b);
        long long aux=x;
        x=y;
        y=aux-y*(a/b);
    }
}

int main()
{
    ifstream fin ("inversmodular.in");
    ofstream fout ("inversmodular.out");
    cin>>a>>n;
    long long int inv=0,ins;
    gcd(inv,ins,a,n);
    if (inv<=0)
    {
        inv=n+inv%n;
    }
    cout<<inv;
}