



def 					__lowerCAmelCase		(  __lowerCamelCase	:    int = 4000000	)  ->						int:
					__lowerCAmelCase	   =[0, 1]
					__lowerCAmelCase	   =0
					while fib[i] <= n:
										fib.append(fib[i] + fib[i + 1]	)
										if fib[i + 2] > n:
															break
										i += 1
					__lowerCAmelCase	   =0
					for j in range(len(__lowerCamelCase	) - 1	):
										if fib[j] % 2 == 0:
															total += fib[j]

					return total


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









def 					__lowerCAmelCase		(  __lowerCamelCase	:    list	)  ->						list:
					if len(__lowerCamelCase	) <= 1:
										return lst

					__lowerCAmelCase	   =1

					while i < len(__lowerCamelCase	):
										if lst[i - 1] <= lst[i]:
															i += 1
										else:
															__lowerCAmelCase   ,	__lowerCAmelCase	   =lst[i], lst[i - 1]
															i -= 1
															if i == 0:
																				__lowerCAmelCase	   =1

					return lst


if __name__ == "__main__":
				lowercase_	       =			input('''Enter numbers separated by a comma:\n''').strip()
				lowercase_	       =			[int(item) for item in user_input.split(''',''')]
				print(gnome_sort(unsorted))




