n = int(input())
minn = 10**1000
def dfs(x, y, z, l):
    global minn
    if z > minn: return
    if x == 1: minn = min(minn, z); return
    for i in range(2, x+1):
        if not (x % i) and i <= l:
            dfs(x//i, y+1, z*([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61][y]**(i-1)), i)
dfs(n, 0, 1, 10000000000);print(minn)