



"""simple docstring"""







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


if __name__ == "__main__":
 import doctest

 doctest.testmod()








"""simple docstring"""







from math import factorial



def   a_	(			__a		,							__a      ):
     return factorial(__a      ) / (factorial(__a      ) * factorial(n - r      ))



def   a_	(			):
     A__				=   0

     for i in range(1		,							101      ):
          for j in range(1		,							i + 1      ):
               if combinations(__a		,							__a      ) > 1e6:
                    total += 1
     return total


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



