




"""simple docstring"""




from __future__ import annotations



def     a__ (				snake_case__       , snake_case__				)						->					Dict:
			# Checks if the entire collection has been sorted
			if len(snake_case__				) <= 1 or n <= 1:
						return

			insert_next(snake_case__       , n - 1				)
			rec_insertion_sort(snake_case__       , n - 1				)



def     a__ (				snake_case__       , snake_case__				)						->					Optional[int]:
			# Checks order between adjacent elements
			if index >= len(snake_case__				) or collection[index - 1] <= collection[index]:
						return

			# Swaps adjacent elements since they are not in ascending order
			lowerCamelCase      ,   lowerCamelCase			      =					(
			    collection[index],
			    collection[index - 1],
			)

			insert_next(snake_case__       , index + 1				)


if __name__ == "__main__":
					lowerCAmelCase							:			Union[str, Any]     							=							input("""Enter integers separated by spaces: """)
					lowerCAmelCase							:			list[int]     							=							[int(num) for num in numbers.split()]
					rec_insertion_sort(number_list, len(number_list))
					print(number_list)









"""simple docstring"""




from collections.abc import Generator



def     a__ (				)						->					Generator[int, None, None]:
			lowerCamelCase      ,   lowerCamelCase			      =					0, 1
			while True:
						lowerCamelCase      ,   lowerCamelCase			      =					b, a + b
						yield b



def     a__ (				snake_case__ = 10_00				)						->					int:
			lowerCamelCase			      =					1
			lowerCamelCase			      =					fibonacci_generator()
			while len(str(next(snake_case__				)				)				) < n:
						answer += 1
			return answer + 1


if __name__ == "__main__":
					print(solution(int(str(input()).strip())))



