from math import floor

def natural_numbers():
  i = 1
  while True:
    yield i
    i += 1

def good_numbers():
  num = 0
  for i in natural_numbers():
    num += i
    yield num

def num_of_divisors(num: int):
  counter = 0
  temp = floor(num ** 0.5)
  for i in range(1, temp + 1):
    if num % i == 0:
      counter += 1
  if temp == num ** 0.5:
    return counter * 2 - 1
  return counter * 2
  
k = int(input())

for i in good_numbers():
  if num_of_divisors(i) >= k:
    print(i)
    break