




'''simple docstring'''

def    snake_case__     (  )			->       Optional[int]:





			'''simple docstring'''






			snake_case__          =						1

			while True:
						if (
						    sorted(str(a	)	)
						    == sorted(str(2 * i	)	)
						    == sorted(str(3 * i	)	)
						    == sorted(str(4 * i	)	)
						    == sorted(str(5 * i	)	)
						    == sorted(str(6 * i	)	)
						):
									return i

						i += 1


if __name__ == "__main__":
		print(solution())
"""simple docstring"""

def    lowerCAmelCase			(__UpperCamelCase							:    list							,					__UpperCamelCase							:    int			):
							"""simple docstring"""


							for index, item in enumerate(__UpperCamelCase			):
														if item == target:
																					return index
							return -1


def    lowerCAmelCase			(__UpperCamelCase							:    list							,					__UpperCamelCase							:    int							,					__UpperCamelCase							:    int							,					__UpperCamelCase							:    int			):
							"""simple docstring"""


							if not (0 <= high < len(__UpperCamelCase			) and 0 <= low < len(__UpperCamelCase			)):
														raise Exception('''Invalid upper or lower bound!'''			)
							if high < low:
														return -1
							if sequence[low] == target:
														return low
							if sequence[high] == target:
														return high
							return rec_linear_search(__UpperCamelCase							,					low + 1							,					high - 1							,					__UpperCamelCase			)


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

				__lowercase    =				int(input('''Enter a single number to be found in the list:\n''').strip())
				__lowercase    =				linear_search(sequence, target)
				if result != -1:
								print(f'''linear_search({sequence}, {target}) = {result}''')
				else:
								print(f'''{target} was not found in {sequence}''')



