

def        _lowercase  (					a_					:       int					)					->						int:




					'''simple docstring'''







					return n * (2 * n - 1)




def        _lowercase  (					a_					:       int					)					->						bool:




					'''simple docstring'''







					__magic_name__				=     (1 + 2_4 * n) ** 0.5
					return ((1 + root) / 6) % 1 == 0




def        _lowercase  (					a_					:       int = 1_4_4					)					->						int:




					'''simple docstring'''







					__magic_name__				=     start
					__magic_name__				=     hexagonal_num(a_					)
					while not is_pentagonal(a_					):
										n += 1
										__magic_name__				=     hexagonal_num(a_					)
					return num


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







def        _lowercase  (					a_					:       str       ,a_					:       List[str]					)					->						Optional[Any]:




					'''simple docstring'''







					sequence.append(a_					)

					__magic_name__				=     0
					while sequence[index] != target:
										index += 1

					sequence.pop()

					if index == len(a_					):
										return None

					return index


if __name__ == "__main__":
						A__							=				input("Enter numbers separated by comma:\n").strip()
						A__							=				[int(item) for item in user_input.split(",")]

						A__							=				input("Enter a single number to be found in the list:\n")
						A__							=				int(target_input)
						A__							=				sentinel_linear_search(sequence, target)
						if result is not None:
												print(f'''{target} found at positions: {result}''')
						else:
												print("Not found")




