



def 		__snake_case						(    _UpperCAmelCase				):
					"""simple docstring"""






					if len(__snake_case				) == 1:
										return a[0], a[0]
					else:
										# split A into half.
										lowercase						   =       a[: len(__snake_case				) // 2]
										lowercase						   =       a[len(__snake_case				) // 2 :]

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

										# get min of first and max of second
										# linear time
										lowercase						   =       min(__snake_case				)
										lowercase						   =       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()












def  a_		(							__snake_case					)	->			str:

			'''simple docstring'''


			return " ".join([word[::-1] for word in input_str.split()]					)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
