
from collections import defaultdict
from math import gcd



def       __lowerCAmelCase      (						A = 1500000    ):
	UpperCAmelCase_       				=			defaultdict(UpperCAmelCase__    )
	UpperCAmelCase_       				=			2
	while 2 * euclid_m * (euclid_m + 1) <= limit:
		for euclid_n in range((euclid_m % 2) + 1       ,     UpperCAmelCase__       ,     2    ):
			if gcd(UpperCAmelCase__       ,     UpperCAmelCase__    ) > 1:
				continue
			UpperCAmelCase_       				=			2 * euclid_m * (euclid_m + euclid_n)
			for perimeter in range(UpperCAmelCase__       ,     limit + 1       ,     UpperCAmelCase__    ):
				frequencies[perimeter] += 1
		euclid_m += 1
	return sum(1 for frequency in frequencies.values() if frequency == 1    )


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


def       __lowerCAmelCase      (						A    ):
	if len(A    ) <= 1:
		return lst

	UpperCAmelCase_       				=			1

	while i < len(A    ):
		if lst[i - 1] <= lst[i]:
			i += 1
		else:
			UpperCAmelCase_				,   UpperCAmelCase_       				=			lst[i], lst[i - 1]
			i -= 1
			if i == 0:
				UpperCAmelCase_       				=			1

	return lst


if __name__ == "__main__":
				_a:    List[Any] 							=			input("""Enter numbers separated by a comma:\n""").strip()
				_a:    Optional[int] 							=			[int(item) for item in user_input.split(""",""")]
				print(gnome_sort(unsorted))