



"""simple docstring"""






def 	snake_case_  (				A_ :		list						):


							'''simple docstring'''





							def merge(A_ :		list,    A_ :		list						) -> list:

														def _merge():
																					while left and right:
																												yield (left if left[0] <= right[0] else right).pop(0						)
																					yield from left
																					yield from right

														return list(_merge()						)

							if len(A_						) <= 1:
														return collection
							_lowerCamelCase						:    str         =			len(A_						) // 2
							return merge(merge_sort(collection[:mid]						),    merge_sort(collection[mid:]						)						)


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			lowerCAmelCase__      =    input('''Enter numbers separated by a comma:\n''').strip()
			lowerCAmelCase__      =    [int(item) for item in user_input.split(''',''')]
			print(*merge_sort(unsorted), sep=''',''')







"""simple docstring"""






from itertools import permutations






def 	snake_case_  (				A_ :		tuple						):


       '''simple docstring'''





       if num[3] % 2 != 0:
              return False

       if (num[2] + num[3] + num[4]) % 3 != 0:
              return False

       if num[5] % 5 != 0:
              return False

       _lowerCamelCase						:    Any         =			[7, 11, 13, 17]
       for i, test in enumerate(A_						):
              if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                     return False
       return True






def 	snake_case_  (				A_ :		int = 10						):


       '''simple docstring'''





       return sum(
           int(''''''.join(map(A_,    A_						)						)						)
           for num in permutations(range(A_						)						)
           if is_substring_divisible(A_						)						)


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


