import sys

n = int(input())

max1 = 2**n
count = 1
ls = []
set1 = {2,3,5}
for i in range(n):
    for j in range(n):
        for k in range(n):
            temp = (5**i)*(3**j)*(2**k)
            ls.append(temp)
            if temp >2**n:      # 第n个丑数,一定小于等于2**n,降低复杂度
                break
ls.sort()
print(ls[n-1])