






'''simple docstring'''





def   lowerCamelCase      (		a_			)			->    int:
							lowerCAmelCase_       		=  0
							for letter in data:
														lowerCAmelCase_       		=  (hash_ << 4) + ord(lowercase__			)
														lowerCAmelCase_       		=  hash_ & 0Xf000_0000
														if x != 0:
																					hash_ ^= x >> 24
														hash_ &= ~x
							return hash_


if __name__ == "__main__":
		import doctest

		doctest.testmod()











def   lowerCamelCase      (		a_ = 4_000_000			)			->    int:

							if n <= 1:
														return 0
							lowerCAmelCase_       		=  0
							lowerCAmelCase_       		=  2
							lowerCAmelCase_       		=  0
							while 4 * b + a <= n:
														lowerCAmelCase_		,     lowerCAmelCase_       		=  b, 4 * b + a
														count += a
							return count + b


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



