

def 	snake_case_      (__A     :						List[Any]					,   __A     :						Union[str, Any]     )			->	int:
   if n < 0:
      return 0
   # table[i] represents the number of ways to get to amount i
   __lowerCAmelCase  :			str					    =						[0] * (n + 1)

   # There is exactly 1 way to get to zero(You pick no coins).
   __lowerCAmelCase  :			List[Any]					    =						1

   # Pick all coins one by one and update table[] values
   # after the index greater than or equal to the value of the
   # picked coin
   for coin_val in s:
      for j in range(__A					,   n + 1     ):
         table[j] += table[j - coin_val]

   return table[n]


if __name__ == "__main__":
   import doctest

   doctest.testmod()



def 							lowerCAmelCase(	__lowerCamelCase      ,				__lowerCamelCase						):
					sequence.append(__lowerCamelCase						)

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

					sequence.pop()

					if index == len(__lowerCamelCase						):
										return None

					return index


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

	lowerCamelCase_				:		Tuple       						=       input("""Enter a single number to be found in the list:\n""")
	lowerCamelCase_				:		Optional[int]       						=       int(target_input)
	lowerCamelCase_				:		List[Any]       						=       sentinel_linear_search(sequence, target)
	if result is not None:
		print(F'''{target} found at positions: {result}''')
	else:
		print("""Not found""")




