import math
n,b=map(int,input().split())
def solve(n,b):
    if  ( math.gcd(n,b)!=1):
        print("NaN")
        return
    i=pow(n,-1,b)
    print(i)  
    return  
# for i in range(0,10**3):
#     for j in range(1,10**3):
#         print("N ->",i,"B ->",j)
#         solve(i,j)
solve(n,b)