#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int N=1e5+5;
void euclid(int a , int b ,int & x ,int & y)
{
    if(b == 0)
    {
        x = 1, y = 1;
    }
    else
    {
        int x1 , y1;
        euclid(b , a % b , x1 , y1);
        x = y1;
        y = x1 - a / b * y1;
    }
}
signed main()
{
    ifstream cin("inversmodular.in");ofstream cout("inversmodular.out");
    int n,mod;
    cin>>n>>mod;
    int x=0,y=0;
    euclid(n,mod,x,y);
    while(x<0) x+=mod;
    x%=mod;
    cout<<x;
}