#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <queue>
#include<cstdlib>
using namespace std;
	
#define MAXN 101

#define INF 1<<30

int v[MAXN];

int main()
{
	FILE *f = fopen("inversmodular.in", "r");
	FILE *g = fopen("inversmodular.out", "w");

	long long int A, N;
	fscanf(f, "%lld %lld", &A, &N); 

	for (long long int i = 1; i < N; i++)
	{
		if ( (long long int)(i * A) % N == 1)
		{
			fprintf(g, "%lld", i);
			return 0;
		}
	}

	fclose(f); fclose(g);
	return 0;
}