


def 			UpperCamelCase (     __magic_name__					:							int = 50					)       ->  int:
		"""simple docstring"""




		lowercase__					      =		[1] * (length + 1)

		for row_length in range(length + 1					):
				for tile_length in range(2   ,   5					):
						for tile_start in range(row_length - tile_length + 1					):
								ways_number[row_length] += ways_number[
								    row_length - tile_start - tile_length
								]

		return ways_number[length]


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'))

