def 					UpperCamelCase__		(							A__ = 400_0000       )  ->   int:

				if n <= 1:
								return 0
				snake_case__   :      Optional[Any]   				= 0
				snake_case__   :      Optional[int]   				= 2
				snake_case__   :      str   				= 0
				while 4 * b + a <= n:
								snake_case__				,    snake_case__   :      Optional[Any]   				= b, 4 * b + a
								count += a
				return count + b


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



def 					UpperCamelCase__		(							A__     ,					A__       )  ->   Any:
				if len(str(A__       )       ) == 1 or len(str(A__       )       ) == 1:
								return a * b

				snake_case__   :      Union[str, Any]   				= max(len(str(A__       )       )     ,					len(str(A__       )       )       )
				snake_case__   :      str   				= ma // 2

				snake_case__				,    snake_case__   :      Tuple   				= divmod(A__     ,					10**ma       )
				snake_case__				,    snake_case__   :      str   				= divmod(A__     ,					10**ma       )

				snake_case__   :      Optional[int]   				= karatsuba(A__     ,					A__       )
				snake_case__   :      List[Any]   				= karatsuba((aa + aa)     ,					(ba + ba)       )
				snake_case__   :      Tuple   				= karatsuba(A__     ,					A__       )

				return (z * 10 ** (2 * ma)) + ((y - z - x) * 10 ** (ma)) + (x)
def 					UpperCamelCase__		(							)  ->   Optional[int]:
				print(karatsuba(1_5463     ,					2_3489       )       )


if __name__ == "__main__":
				main()


