from itertools import count




def     UpperCamelCase						(	__lowercase						:			int = 50     ):
		'''simple docstring'''




		A_		:    Optional[Any]         =				[1] * min_block_length

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

				for block_length in range(__lowercase						,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] > 1_00_00_00:
						break

		return n


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







import math




def     UpperCamelCase						(	__lowercase						:			int = 1_00     ):
		'''simple docstring'''




		A_		:    List[Any]         =				sum(i * i for i in range(1						,n + 1     )     )
		A_		:    int         =				int(math.pow(sum(range(1						,n + 1     )     )						,2     )     )
		return square_of_sum - sum_of_squares


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






