import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
n,b = map(int,input().split())
if math.gcd(n,b) != 1:
    exit(print('NaN'))

z = 0
for i in range(1,b):
    if math.gcd(b,i) == 1:
        z += 1
print(pow(n,z-1,b))