






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				if not nums:  # Makes sure that the list is not empty
								raise ValueError('''List is empty'''       )

				lowercase__     				=    sum(lowerCamelCase_       ) / len(lowerCamelCase_       )  # Calculate the average
				return sum(abs(x - average       ) for x in nums       ) / len(lowerCamelCase_       )


if __name__ == "__main__":
							import doctest

							doctest.testmod()












from itertools import count






def 						a    (		lowerCamelCase_ = 50       ):






				'''simple docstring'''
				lowercase__     				=    [1] * min_block_length

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

								for block_length in range(lowerCamelCase_	,     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() = }")




