"""simple docstring"""




def 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: Tuple			) ->   list:
  _lowerCAmelCase		: Optional[Any]						    =  len(_lowerCamelCase			)
  for i in range(1    ,_lowerCamelCase			):
    _lowerCAmelCase		: List[str]						    =  collection[i]
    _lowerCAmelCase		: Tuple						    =  0
    _lowerCAmelCase		: List[str]						    =  i - 1

    while low <= high:
      _lowerCAmelCase		: Dict						    =  (low + high) // 2
      if val < collection[mid]:
        _lowerCAmelCase		: Union[str, Any]						    =  mid - 1
      else:
        _lowerCAmelCase		: str						    =  mid + 1
    for j in range(_lowerCamelCase    ,_lowerCamelCase    ,-1			):
      _lowerCAmelCase		: str						    =  collection[j - 1]
    _lowerCAmelCase		: str						    =  val
  return collection


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





"""simple docstring"""




def 							SCREAMING_SNAKE_CASE  (    _lowerCamelCase		: int = 1000000			) ->   int:
  _lowerCAmelCase		: List[str]						    =  [i - 1 for i in range(limit + 1			)]

  for i in range(2    ,limit + 1			):
    if phi[i] == i - 1:
      for j in range(2 * i    ,limit + 1    ,_lowerCamelCase			):
        phi[j] -= phi[j] // i

  return sum(phi[2 : limit + 1]			)


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




