

from itertools import permutations



def 			_A	(      SCREAMING_SNAKE_CASE      ):
	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

	UpperCAmelCase__:	str									= [7, 1_1, 1_3, 1_7]
	for i, test in enumerate(SCREAMING_SNAKE_CASE      ):
		if (num[i + 4] * 1_0_0 + num[i + 5] * 1_0 + num[i + 6]) % test != 0:
			return False
	return True



def 			_A	(      SCREAMING_SNAKE_CASE = 1_0      ):
	return sum(
	    int("".join(map(SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      )      )      )
	    for num in permutations(range(SCREAMING_SNAKE_CASE      )      )
	    if is_substring_divisible(SCREAMING_SNAKE_CASE      )      )


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


def 			_A	(      SCREAMING_SNAKE_CASE      ):
	UpperCAmelCase__							,						UpperCAmelCase__:	int									= [], []
	while len(SCREAMING_SNAKE_CASE      ) > 1:
		UpperCAmelCase__							,						UpperCAmelCase__:	str									= min(SCREAMING_SNAKE_CASE      ), max(SCREAMING_SNAKE_CASE      )
		start.append(SCREAMING_SNAKE_CASE      )
		end.append(SCREAMING_SNAKE_CASE      )
		collection.remove(SCREAMING_SNAKE_CASE      )
		collection.remove(SCREAMING_SNAKE_CASE      )
	end.reverse()
	return start + collection + end


if __name__ == "__main__":
					_lowerCAmelCase  :      Union[str, Any]			 =input("""Enter numbers separated by a comma:\n""").strip()
					_lowerCAmelCase  :      Dict			 =[int(item) for item in user_input.split(""",""")]
					print(*merge_sort(unsorted), sep=""",""")