
"""simple docstring"""

def 		UpperCAmelCase (		a_ = 400_0000      ):





		'''simple docstring'''


		lowerCamelCase					:      Optional[int]          =   [0, 1]
		lowerCamelCase					:      List[str]          =   0
		while fib[i] <= n:
				fib.append(fib[i] + fib[i + 1]      )
				if fib[i + 2] > n:
						break
				i += 1
		lowerCamelCase					:      Any          =   0
		for j in range(len(a_      ) - 1      ):
				if fib[j] % 2 == 0:
						total += fib[j]

		return total


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








"""simple docstring"""

def 		UpperCAmelCase (		a_      ):





		'''simple docstring'''


		return str(a_      ) == str(a_      )[::-1]
def 		UpperCAmelCase (		a_      ):





		'''simple docstring'''


		return int(a_      ) + int(str(a_      )[::-1]      )
def 		UpperCAmelCase (		a_ = 1_0000      ):





		'''simple docstring'''


		lowerCamelCase					:      Optional[Any]          =   []
		for num in range(1,						a_      ):
				lowerCamelCase					:      List[str]          =   0
				lowerCamelCase					:      Union[str, Any]          =   num
				while iterations < 50:
						lowerCamelCase					:      Optional[int]          =   sum_reverse(a_      )
						iterations += 1
						if is_palindrome(a_      ):
								break
				else:
						lychrel_nums.append(a_      )
		return len(a_      )


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






