


def       _a			(				SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		lowercase__						=				int(SCREAMING_SNAKE_CASE					)
		if n_element < 1:
				lowercase__						=				ValueError('''a should be a positive number'''					)
				raise my_error

		lowercase__						=				[1]
		lowercase__					,		lowercase__					,		lowercase__						=				(0, 0, 0)
		lowercase__						=				1
		while index < n_element:
				while hamming_list[i] * 2 <= hamming_list[-1]:
						i += 1
				while hamming_list[j] * 3 <= hamming_list[-1]:
						j += 1
				while hamming_list[k] * 5 <= hamming_list[-1]:
						k += 1
				hamming_list.append(
				    min(hamming_list[i] * 2						,    hamming_list[j] * 3						,    hamming_list[k] * 5					)					)
				index += 1
		return hamming_list


if __name__ == "__main__":
			lowerCAmelCase	=							input('Enter the last number (nth term) of the Hamming Number Series: ')
			print('Formula of Hamming Number Series => 2^i * 3^j * 5^k')
			lowerCAmelCase	=							hamming(int(n))
			print('-----------------------------------------------------')
			print(f"""The list with nth numbers is: {hamming_numbers}""")
			print('-----------------------------------------------------')






def       _a			(				SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




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


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


