'''simple docstring'''

def __a (	__lowerCamelCase			:						list[int] ,		__lowerCamelCase			:						int				)	->							bool:
      '''simple docstring'''


      lowercase_     =      len(__lowerCamelCase				)
      lowercase_     =      [[False] * (required_sum + 1) for _ in range(arr_len + 1				)]

      # for each arr value, a sum of zero(0) can be formed by not taking any element
      # hence True/1
      for i in range(arr_len + 1				):
            lowercase_     =      True

      # sum is not zero and set is empty then false
      for i in range(1 ,		required_sum + 1				):
            lowercase_     =      False

      for i in range(1 ,		arr_len + 1				):
            for j in range(1 ,		required_sum + 1				):
                  if arr[i - 1] > j:
                        lowercase_     =      subset[i - 1][j]
                  if arr[i - 1] <= j:
                        lowercase_     =      subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

      return subset[arr_len][required_sum]


if __name__ == "__main__":
       import doctest

       doctest.testmod()







'''simple docstring'''

def __a (	__lowerCamelCase			:						int = 600_851_475_143				)	->							int:
      '''simple docstring'''


      try:
            lowercase_     =      int(__lowerCamelCase				)
      except (TypeError, ValueError):
            raise TypeError("Parameter n must be int or castable to int."				)
      if n <= 0:
            raise ValueError("Parameter n must be greater than or equal to one."				)
      lowercase_     =      1
      lowercase_     =      2
      while i * i <= n:
            while n % i == 0:
                  lowercase_     =      i
                  n //= i
            i += 1
      if n > 1:
            lowercase_     =      n
      return int(__lowerCamelCase				)


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






