


'''simple docstring'''

def __UpperCamelCase   (			__lowerCamelCase		: int      ,  __lowerCamelCase		: int				)      ->     int:







     '''simple docstring'''






     while a != 0:
          _a			,			_a						=		b % a, a
     return b






def __UpperCamelCase   (			__lowerCamelCase		: int      ,  __lowerCamelCase		: int				)      ->     int:







     '''simple docstring'''






     if gcd(__lowerCamelCase      ,  __lowerCamelCase				) != 1:
          _a						=		F"mod inverse of {a!r} and {m!r} does not exist"
          raise ValueError(__lowerCamelCase				)
     _a			,			_a			,			_a						=		1, 0, a
     _a			,			_a			,			_a						=		0, 1, m
     while va != 0:
          _a						=		ua // va
          _a			,			_a			,			_a			,			_a			,			_a			,			_a						=		(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
     return ua % m





'''simple docstring'''

def __UpperCamelCase   (			__lowerCamelCase		: int = 400_0000				)      ->     int:







     '''simple docstring'''






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


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

