

'''simple docstring'''







import math
import sys
def  UpperCAmelCase__      ( UpperCAmelCase__			)     ->     int:
       if number != int(UpperCAmelCase__			):
              raise ValueError("""the value of input must be a natural number"""			)
       if number < 0:
              raise ValueError("""the value of input must not be a negative number"""			)
       if number == 0:
              return 1
       A_		   = [-1] * (number + 1)
       A_		   = 0
       for i in range(1,    number + 1			):
              A_		   = sys.maxsize
              A_		   = int(math.sqrt(UpperCAmelCase__			)			)
              for j in range(1,    root + 1			):
                     A_		   = 1 + answers[i - (j**2)]
                     A_		   = min(UpperCAmelCase__,    UpperCAmelCase__			)
              A_		   = answer
       return answers[number]


if __name__ == "__main__":
      import doctest

      doctest.testmod()



'''simple docstring'''







def  UpperCAmelCase__      ( UpperCAmelCase__,    UpperCAmelCase__			)     ->     bool:
       A_		   = len(UpperCAmelCase__			)
       A_		   = [[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			):
              A_		   = True

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

       for i in range(1,    arr_len + 1			):
              for j in range(1,    required_sum + 1			):
                     if arr[i - 1] > j:
                            A_		   = subset[i - 1][j]
                     if arr[i - 1] <= j:
                            A_		   = 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()
