def    __lowerCamelCase	(		lowerCAmelCase__			):
       lowerCAmelCase__  			=      len(lowerCAmelCase__			)
       if n in (0, 1):
              return 0
       return sum(query * (n - i - 1) for i, query in enumerate(sorted(lowerCAmelCase__			)			)			)


if __name__ == "__main__":
    import doctest

    doctest.testmod()

def    __lowerCamelCase	(		lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			):
       if target == 0:
              answer.append(path.copy()			)
       else:
              for index in range(lowerCAmelCase__			,						len(lowerCAmelCase__			)			):
                     if target >= candidates[index]:
                            path.append(candidates[index]			)
                            backtrack(lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			,						target - candidates[index]			,						lowerCAmelCase__			)
                            path.pop(len(lowerCAmelCase__			) - 1			)






def    __lowerCamelCase	(		lowerCAmelCase__			,						lowerCAmelCase__			):
       lowerCAmelCase__  			=      []  # type: list[int]
       lowerCAmelCase__  			=      []  # type: list[int]
       backtrack(lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			,						lowerCAmelCase__			,						0			)
       return answer






def    __lowerCamelCase	(		):
       print(combination_sum([-8, 2.3, 0]			,						1			)			)


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()
