
from __future__ import annotations

__lowerCAmelCase					   =       [True] * 1_0_0_0_0_0_1
__lowerCAmelCase					   =       2
while i * i <= 1_0_0_0_0_0_0:
							if seive[i]:
														for j in range(i * i, 1_0_0_0_0_0_1, i):
																					__lowerCAmelCase					   =       False
							i += 1


def    a      ( a	)     ->bool:




			'''simple docstring'''


			return seive[n]


def    a      ( a	)     ->bool:




			'''simple docstring'''


			return any(digit in '''02468''' for digit in str(a	)	)


def    a      ( a = 100_0000	)     ->list[int]:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= [2]  # result already includes the number 2.
			for num in range(3		,						limit + 1		,						2	):
						if is_prime(a	) and not contains_an_even_digit(a	):
									SCREAMING_SNAKE_CASE     						= str(a	)
									SCREAMING_SNAKE_CASE     						= [int(str_num[j:] + str_num[:j]	) for j in range(len(a	)	)]
									if all(is_prime(a	) for i in list_nums	):
												result.append(a	)
			return result


def    a      ( )     ->int:




			'''simple docstring'''


			return len(find_circular_primes()	)


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

def    a      ( a	)     ->List[Any]:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= len(a	)
			while cur > 1:
						# Find the maximum number in arr
						SCREAMING_SNAKE_CASE     						= arr.index(max(arr[0:cur]	)	)
						# Reverse from 0 to mi
						SCREAMING_SNAKE_CASE     						= arr[mi::-1] + arr[mi + 1 : len(a	)]
						# Reverse whole list
						SCREAMING_SNAKE_CASE     						= arr[cur - 1 :: -1] + arr[cur : len(a	)]
						cur -= 1
			return arr


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