


'''simple docstring'''





def 							UpperCamelCase_  (				__snake_case			:						Optional[int]	,			__snake_case			:						Tuple	,			__snake_case			:						Union[str, Any]	,			__snake_case			:						Optional[int]     )->      Dict:




						'''simple docstring'''
						if start == end:
												return start if lst[start] > item else start + 1
						if start > end:
												return start

						__magic_name__ 		=			(start + end) // 2
						if lst[mid] < item:
												return binary_search(__snake_case	,			__snake_case	,			mid + 1	,			__snake_case     )
						elif lst[mid] > item:
												return binary_search(__snake_case	,			__snake_case	,			__snake_case	,			mid - 1     )
						else:
												return mid
def 							UpperCamelCase_  (				__snake_case			:						Optional[Any]     )->      str:




						'''simple docstring'''
						__magic_name__ 		=			len(__snake_case     )

						for index in range(1	,			__snake_case     ):
												__magic_name__ 		=			lst[index]
												__magic_name__ 		=			binary_search(__snake_case	,			__snake_case	,			0	,			index - 1     )
												__magic_name__ 		=			lst[:pos] + [value] + lst[pos:index] + lst[index + 1 :]

						return lst
def 							UpperCamelCase_  (				__snake_case			:						Optional[int]	,			__snake_case			:						List[Any]     )->      Optional[Any]:




						'''simple docstring'''
						if not left:
												return right

						if not right:
												return left

						if left[0] < right[0]:
												return [left[0], *merge(left[1:]	,			__snake_case     )]

						return [right[0], *merge(__snake_case	,			right[1:]     )]
def 							UpperCamelCase_  (				__snake_case			:						List[str]     )->      List[str]:




						'''simple docstring'''
						__magic_name__ 		=			len(__snake_case     )
						__magic_name__		,			__magic_name__ 		=			[], []
						__magic_name__ 		=			[lst[0]]
						__magic_name__ 		=			[]
						__magic_name__ 		=			1
						while i < length:
												if lst[i] < lst[i - 1]:
																		runs.append(__snake_case     )
																		__magic_name__ 		=			[lst[i]]
												else:
																		new_run.append(lst[i]     )
												i += 1
						runs.append(__snake_case     )

						for run in runs:
												sorted_runs.append(insertion_sort(__snake_case     )     )
						for run in sorted_runs:
												__magic_name__ 		=			merge(__snake_case	,			__snake_case     )

						return sorted_array
def 							UpperCamelCase_  (				)->      int:




						'''simple docstring'''
						__magic_name__ 		=			[5, 9, 10, 3, -4, 5, 1_78, 92, 46, -18, 0, 7]
						__magic_name__ 		=			tim_sort(__snake_case     )
						print(__snake_case     )


if __name__ == "__main__":
					main()





def 							UpperCamelCase_  (				__snake_case			:						int = 1_00     )->      int:




						'''simple docstring'''
						__magic_name__ 		=			1
						__magic_name__ 		=			0
						for i in range(1	,			num + 1     ):
												fact *= i

						for j in str(__snake_case     ):
												result += int(__snake_case     )

						return result


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

