"""simple docstring"""



def 					_lowerCamelCase(					a=2_8_1_2_3							):
       __a     				=  [1] * (limit + 1)

       for i in range(2 ,  int(limit**0.5							) + 1							):
              sum_divs[i * i] += i
              for k in range(i + 1 ,  limit // i + 1							):
                     sum_divs[k * i] += k + i

       __a     				=  set()
       __a     				=  0

       for n in range(1 ,  limit + 1							):
              if sum_divs[n] > n:
                     abundants.add(a							)

              if not any((n - a in abundants) for a in abundants							):
                     res += n

       return res


if __name__ == "__main__":
   print(solution())

"""simple docstring"""



def 					_lowerCamelCase(					a							):
       __a     				=  len(a							)
       for i in range(1 ,  a							):
              __a     				=  collection[i]
              __a     				=  0
              __a     				=  i - 1

              while low <= high:
                     __a     				=  (low + high) // 2
                     if val < collection[mid]:
                            __a     				=  mid - 1
                     else:
                            __a     				=  mid + 1
              for j in range(a ,  a ,  -1							):
                     __a     				=  collection[j - 1]
              __a     				=  val
       return collection


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