




import math

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					bool:
     a     =				math.loga(math.sqrt(4 * positive_integer + 1) / 2 + 1 / 2)

     return exponent == int(__UpperCamelCase)

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase = 1 / 1_23_45)      ->					int:
     a     =				0
     a     =				0

     a     =				3
     while True:
          a     =				(integer**2 - 1) / 4
          # if candidate is an integer, then there is a partition for k
          if partition_candidate == int(__UpperCamelCase):
               a     =				int(__UpperCamelCase)
               total_partitions += 1
               if check_partition_perfect(__UpperCamelCase):
                    perfect_partitions += 1
          if perfect_partitions > 0:
               if perfect_partitions / total_partitions < max_proportion:
                    return int(__UpperCamelCase)
          integer += 1


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







import math
import sys

def  SCREAMING_SNAKE_CASE							(       __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()

