


def        _lowerCamelCase(	lowercase__ = 4_0_0_0_0_0_0	)						->	int:

		'''simple docstring'''







		__lowercase=			[]
		__lowercase,							__lowercase=			0, 1
		while b <= n:
				if b % 2 == 0:
						even_fibs.append(lowercase__	)
				__lowercase,							__lowercase=			b, a + b
		return sum(lowercase__	)


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










from __future__ import annotations







def        _lowerCamelCase(	lowercase__   , lowercase__	)						->	Any:

		'''simple docstring'''







		if len(lowercase__	) <= 1 or n <= 1:
				return

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







def        _lowerCamelCase(	lowercase__   , lowercase__	)						->	Any:

		'''simple docstring'''







		if index >= len(lowercase__	) or collection[index - 1] <= collection[index]:
				return

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

		insert_next(lowercase__   , index + 1	)


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






