






def      lowerCAmelCase__	(    _a       :			list    ):
		snake_case_				:							List[Any]						 =       len(_a    )
		for _ in range(_a    ):
				for i in range(_ % 2  ,      arr_size - 1  ,      2    ):
						if arr[i + 1] < arr[i]:
								snake_case_ ,       snake_case_				:							str						 =       arr[i + 1], arr[i]

		return arr


if __name__ == "__main__":
							lowercase  :							Optional[Any]			  =    list(range(10, 0, -1))
							print(F"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")








def      lowerCAmelCase__	(    _a       :			int    ):
		snake_case_				:							str						 =       1
		for i in range(1  ,      num + 1    ):
				fact *= i
		return fact

def      lowerCAmelCase__	(    _a       :			int    ):
		snake_case_				:							List[str]						 =       0
		while number > 0:
				snake_case_				:							Dict						 =       number % 10
				sum_of_digits += last_digit
				snake_case_				:							List[Any]						 =       number // 10  # Removing the last_digit from the given number
		return sum_of_digits

def      lowerCAmelCase__	(    _a       :			int = 1_00    ):
		snake_case_				:							Optional[Any]						 =       factorial(_a    )
		snake_case_				:							Optional[int]						 =       split_and_add(_a    )
		return result


if __name__ == "__main__":
							print(solution(int(input('''Enter the Number: ''').strip())))
