





def   __lowerCamelCase   (				__a  :int = 4_0_0_0_0_0_0       )						->							int:






		"""simple docstring"""

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


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










def   __lowerCamelCase   (				__a  :int       )						->							Dict:






		"""simple docstring"""

		A__     =  len(__a       )
		A__     =  sum(__a       )

		A__     =  [[False for x in range(s + 1       )] for y in range(n + 1       )]

		for i in range(1       ,	n + 1       ):
				A__     =  True

		for i in range(1       ,	s + 1       ):
				A__     =  False

		for i in range(1       ,	n + 1       ):
				for j in range(1       ,	s + 1       ):
						A__     =  dp[i][j - 1]

						if arr[i - 1] <= j:
								A__     =  dp[i][j] or dp[i - 1][j - arr[i - 1]]

		for j in range(int(s / 2       )       ,	-1       ,	-1       ):
				if dp[n][j] is True:
						A__     =  s - 2 * j
						break

		return diff



