





from __future__ import annotations

import math

def   a_    ( lowerCAmelCase_      :			int	):

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5,	int(math.sqrt(UpperCamelCase__	) + 1	),	6	):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True

def   a_    ( lowerCAmelCase_      :			int	):
   __lowerCAmelCase								=	str(UpperCamelCase__	)
   __lowerCAmelCase								=	[n]
   for i in range(1,	len(UpperCamelCase__	)	):
      list_nums.append(int(str_num[i:]	)	)
      list_nums.append(int(str_num[:-i]	)	)
   return list_nums

def   a_    ( lowerCAmelCase_      :			int	):
   if len(str(UpperCamelCase__	)	) > 3:
      if not is_prime(int(str(UpperCamelCase__	)[-3:]	)	) or not is_prime(int(str(UpperCamelCase__	)[:3]	)	):
         return False
   return True

def   a_    ( lowerCAmelCase_      :			int = 11	):
   __lowerCAmelCase								=	[]
   __lowerCAmelCase								=	13
   while len(UpperCamelCase__	) != count:
      if validate(UpperCamelCase__	):
         __lowerCAmelCase								=	list_truncated_nums(UpperCamelCase__	)
         if all(is_prime(UpperCamelCase__	) for i in list_nums	):
            list_truncated_primes.append(UpperCamelCase__	)
      num += 2
   return list_truncated_primes

def   a_    ( ):
   return sum(compute_truncated_primes(11	)	)


if __name__ == "__main__":
     print(F"""{sum(compute_truncated_primes(11)) = }""")








def 	UpperCamelCase__(       UpperCamelCase__			:       Dict  )->Dict:
       # if the collection is empty, returns empty
       if collection == []:
              return []

       # get some information about the collection
       A__											=						len(UpperCamelCase__  )
       A__											=						max(UpperCamelCase__  )
       A__											=						min(UpperCamelCase__  )

       # create the counting array
       A__											=						coll_max + 1 - coll_min
       A__											=						[0] * counting_arr_length

       # count how much a number appears in the collection
       for number in collection:
              counting_arr[number - coll_min] += 1

       # sum each position with it's predecessors. now, counting_arr[i] tells
       # us how many elements <= i has in the collection
       for i in range(1 ,     UpperCamelCase__  ):
              A__											=						counting_arr[i] + counting_arr[i - 1]

       # create the output collection
       A__											=						[0] * coll_len

       # place the elements in the output, respecting the original order (stable
       # sort) from end to begin, updating counting_arr
       for i in reversed(range(0 ,     UpperCamelCase__  )  ):
              A__											=						collection[i]
              counting_arr[collection[i] - coll_min] -= 1

       return ordered


def 	UpperCamelCase__(       UpperCamelCase__			:       Optional[int]  )->Tuple:
       return "".join([chr(UpperCamelCase__  ) for i in counting_sort([ord(UpperCamelCase__  ) for c in string]  )]  )


if __name__ == "__main__":
       # Test string sort
       assert counting_sort_string('thisisthestring') == "eghhiiinrsssttt"

       a__:      Dict									=		input('Enter numbers separated by a comma:\n').strip()
       a__:      Any									=		[int(item) for item in user_input.split(',')]
       print(counting_sort(unsorted))





