





def _A       (   __magic_name__  , __magic_name__	):
   return x if y == 0 else greatest_common_divisor(__magic_name__  , x % y	)


def _A       (   __magic_name__  , __magic_name__	):
   return (x * y) // greatest_common_divisor(__magic_name__  , __magic_name__	)


def _A       (   __magic_name__ = 20	):
   lowercase__			       =  1
   for i in range(1  , n + 1	):
      lowercase__			       =  lcm(__magic_name__  , __magic_name__	)
   return g


if __name__ == "__main__":
  print(F"""{solution() = }""")













from itertools import count


def _A       (   __magic_name__ = 50	):
   lowercase__			       =  [1] * min_block_length

   for n in count(__magic_name__	):
      fill_count_functions.append(1	)

      for block_length in range(__magic_name__  , n + 1	):
         for block_start in range(n - block_length	):
            fill_count_functions[n] += fill_count_functions[
                n - block_start - block_length - 1
            ]

         fill_count_functions[n] += 1

      if fill_count_functions[n] > 100_0000:
         break

   return n


if __name__ == "__main__":
  print(F"""{solution() = }""")






