def div(n): d = [] i = 1 while i * i <= n: if n%i == 0: d.append(i) if n//i != i: d.append(n//i) i += 1 return d # 最大公約数 def gcd(a, b): if a == 0: return b return gcd(b%a, a) # 最小公倍数 def lcm(a, b): return a//gcd(a, b)*b n = int(input()) A = div(n) if len(A) == 1: print(*A) else: ans = lcm(A[0], A[1]) for i in range(2, len(A)): ans = lcm(ans, A[i]) print(ans)