


def 			UpperCamelCase (     __magic_name__					:							int = 10**12					)       ->  int:
		"""simple docstring"""




		lowercase__					      =		1
		lowercase__					      =		0

		lowercase__					      =		1
		lowercase__					      =		1

		while numerator <= 2 * min_total - 1:
				prev_numerator += 2 * numerator
				numerator += 2 * prev_numerator

				prev_denominator += 2 * denominator
				denominator += 2 * prev_denominator

		return (denominator + 1) // 2


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





def 			UpperCamelCase (     __magic_name__					:							str   ,   __magic_name__					:							str					)       ->  list:
		"""simple docstring"""




		lowercase__					      =		len(__magic_name__					)
		lowercase__					      =		[]
		for i in range(len(__magic_name__					) - pat_len + 1					):
				lowercase__					      =		True
				for j in range(__magic_name__					):
						if s[i + j] != pattern[j]:
								lowercase__					      =		False
								break
				if match_found:
						position.append(__magic_name__					)
		return position


if __name__ == "__main__":
	assert naive_pattern_search('ABCDEFG', 'DE') == [3]
	print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))

