# FULL TEMPLATE: delete every block you don't use. Blocks don't depend on each other.
# Nodes are 1..n (slot 0 unused). Arrays are 0-indexed.
import sys
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product
from functools import lru_cache, cmp_to_key
from math import gcd, isqrt, comb, inf
input = sys.stdin.readline
MOD = 10**9 + 7
def I(): return int(input()) # "5" -> 5
def MI(): return map(int, input().split()) # "8 4" -> n, q = MI()
def LI(): return list(map(int, input().split())) # "3 2 4 5" -> [3, 2, 4, 5]
def S(): return input().strip() # "BABAZA", ".*.#" (kept as text)
def LS(): return input().split() # "? 2 3" -> ['?', '2', '3']
# ==== UNION-FIND ==== uf.join(a, b) -> False if already together, uf.size(x)
class UF:
def __init__(self, n):
self.e = [-1] * n
def find(self, x):
e = self.e
while e[x] >= 0:
if e[e[x]] >= 0:
e[x] = e[e[x]]
x = e[x]
return x
def size(self, x):
return -self.e[self.find(x)]
def join(self, a, b):
a, b = self.find(a), self.find(b)
if a == b:
return False
if self.e[a] > self.e[b]:
a, b = b, a
self.e[a] += self.e[b]
self.e[b] = a
return True
# ==== FENWICK ==== ft.add(i, d): a[i] += d. ft.query(i) = a[0] + ... + a[i-1]
class FT:
def __init__(self, n):
self.s = [0] * n
def add(self, i, d):
s, n = self.s, len(self.s)
while i < n:
s[i] += d
i |= i + 1
def query(self, i):
s, r = self.s, 0
while i > 0:
r += s[i - 1]
i &= i - 1
return r
# ==== SEGMENT TREE (min) ==== t.update(i, v): a[i] = v. t.query(l, r) = min of a[l..r-1]
# sum/max: change INF and the 3 lines marked "op"
class Tree:
INF = inf
def __init__(self, a):
n = self.n = len(a)
t = self.t = [self.INF] * n + list(a)
for i in range(n - 1, 0, -1):
t[i] = min(t[2 * i], t[2 * i + 1]) # op
def update(self, i, v):
t = self.t
i += self.n
t[i] = v
i >>= 1
while i:
t[i] = min(t[2 * i], t[2 * i + 1]) # op
i >>= 1
def query(self, l, r):
t, res = self.t, self.INF
l += self.n
r += self.n
while l < r:
if l & 1:
res = min(res, t[l]) # op
l += 1
if r & 1:
r -= 1
res = min(res, t[r]) # op
l >>= 1
r >>= 1
return res
# ==== BFS (unweighted graph) ==== -> dist[v], -1 = unreachable
def bfs(adj, start):
dist = [-1] * len(adj)
dist[start] = 0
q = deque([start])
while q:
u = q.popleft()
for v in adj[u]:
if dist[v] == -1:
dist[v] = dist[u] + 1
q.append(v)
return dist
# ==== DIJKSTRA ==== wadj[u] = [(v, w)] -> dist[v], inf = unreachable
def dijkstra(wadj, start):
dist = [inf] * len(wadj)
dist[start] = 0
pq = [(0, start)]
while pq:
d, u = heappop(pq)
if d != dist[u]:
continue
for v, w in wadj[u]:
if d + w < dist[v]:
dist[v] = d + w
heappush(pq, (dist[v], v))
return dist
# ==== GRID BFS ==== g[r][c], '#' = wall -> dist[r][c], -1 = unreachable
DIRS = ((-1, 0), (1, 0), (0, -1), (0, 1)) # U D L R
def grid_bfs(g, sr, sc):
R, C = len(g), len(g[0])
dist = [[-1] * C for _ in range(R)]
dist[sr][sc] = 0
q = deque([(sr, sc)])
while q:
r, c = q.popleft()
for dr, dc in DIRS:
nr, nc = r + dr, c + dc
if 0 <= nr < R and 0 <= nc < C and g[nr][nc] != '#' and dist[nr][nc] == -1:
dist[nr][nc] = dist[r][c] + 1
q.append((nr, nc))
return dist
# ==== BINARY SEARCH ON THE ANSWER ==== smallest x in [lo, hi] with ok(x) True (ok: False...False True...True)
def first_true(lo, hi, ok):
while lo < hi:
mid = (lo + hi) // 2
if ok(mid):
hi = mid
else:
lo = mid + 1
return lo
# mod power is built in: pow(b, e, MOD). inverse: pow(a, MOD - 2, MOD)
def main():
a, m = MI()
if m == 1:
print(-1) # no x satisfies 0 < x < 1
return
try:
print(pow(a, -1, m))
except ValueError:
print(-1)
main()