text: """
  Problem:
  2520 is the smallest number that can be divided by each of the numbers from 1
  to 10 without any remainder.
  
  What is the smallest positive number that is evenly divisible(divisible with no
  remainder) by all of the numbers from 1 to N?
  """
  """ Euclidean GCD Algorithm """
  
  
  def gcd(x: int, y: int) -> int:
      return x if y == 0 else gcd(y, x % y)
  
  
  """ Using the property lcm*gcd of two numbers = product of them """
  
  
  def lcm(x: int, y: int) -> int:
      return (x * y) // gcd(x, y)
  
  
  def solution(n: int = 20) -> int:
      """Returns the smallest positive number that is evenly divisible(divisible
      with no remainder) by all of the numbers from 1 to n.
  
      >>> solution(10)
      2520
      >>> solution(15)
      360360
      >>> solution(20)
      232792560
      >>> solution(22)
      232792560
      """
      g = 1
      for i in range(1, n + 1):
          g = lcm(g, i)
      return g
  
  
  if __name__ == "__main__":
      print(solution(int(input().strip())))
  