def 				lowerCAmelCase__       (			a__ )      ->list:




  '''simple docstring'''

  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__":
   lowerCamelCase__  =					input('''Enter numbers separated by a comma:\n''').strip()
   lowerCamelCase__  =					[int(item) for item in user_input.split(''',''')]
   print(gnome_sort(unsorted))





def 				lowerCAmelCase__       (			a__ )      ->int:




  '''simple docstring'''

  if not isinstance(a__    ,     a__ ) or number < 0:
    raise ValueError("Input must be a non-negative integer" )

  _UpperCamelCase           =    0
  while number:
    # This way we arrive at next set bit (next 1) instead of looping
    # through each bit and checking for 1s hence the
    # loop won't run 32 times it will only run the number of `1` times
    number &= number - 1
    count += 1
  return count


if __name__ == "__main__":
   import doctest

   doctest.testmod()




