


def 							UpperCamelCase_  (				__snake_case			:						int	,			__snake_case			:						int     )->      int:




						'''simple docstring'''
						__magic_name__ 		=			1.0
						for i in range(1	,			r + 1     ):
												ret *= (n + 1 - i) / i
						return round(__snake_case     )
def 							UpperCamelCase_  (				__snake_case			:						int     )->      int:




						'''simple docstring'''
						return choose(8 + n	,			__snake_case     ) + choose(9 + n	,			__snake_case     ) - 10
def 							UpperCamelCase_  (				__snake_case			:						int     )->      int:




						'''simple docstring'''
						return sum(non_bouncy_exact(__snake_case     ) for i in range(1	,			n + 1     )     )
def 							UpperCamelCase_  (				__snake_case			:						int = 1_00     )->      int:




						'''simple docstring'''
						return non_bouncy_upto(__snake_case     )


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





def 							UpperCamelCase_  (				__snake_case			:						list[int]     )->      tuple[int, int]:




						'''simple docstring'''
						# base case
						if len(__snake_case     ) == 1:
												return a[0], a[0]
						else:
												# split A into half.
												__magic_name__ 		=			a[: len(__snake_case     ) // 2]
												__magic_name__ 		=			a[len(__snake_case     ) // 2 :]

												# 2 sub problems, 1/2 of original size.
												__magic_name__		,			__magic_name__ 		=			max_difference(__snake_case     )
												__magic_name__		,			__magic_name__ 		=			max_difference(__snake_case     )

												# get min of first and max of second
												# linear time
												__magic_name__ 		=			min(__snake_case     )
												__magic_name__ 		=			max(__snake_case     )

												# 3 cases, either (small1, big1),
												# (min_first, max_second), (small2, big2)
												# constant comparisons
												if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
																		return smalla, biga
												elif biga - smalla > max_second - min_first:
																		return smalla, biga
												else:
																		return min_first, max_second


if __name__ == "__main__":
					import doctest

					doctest.testmod()

