'''simple docstring'''





def      lowerCAmelCase_    ( snake_case_	:			int = 10_00      )   ->				int:


     '''simple docstring'''




     return sum(2 * a * ((a - 1) // 2) for a in range(3 ,   n + 1      )      )


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





'''simple docstring'''





from random import randint
from tempfile import TemporaryFile

import numpy as np





def      lowerCAmelCase_    ( snake_case_	:			int ,   snake_case_	:			Any ,   snake_case_	:			int      )   ->				Optional[Any]:


     '''simple docstring'''




     UpperCAmelCase_	   =       0
     if start < end:
          UpperCAmelCase_	   =       randint(snake_case_ ,   snake_case_      )
          UpperCAmelCase_	   =       a[end]
          UpperCAmelCase_	   =       a[pivot]
          UpperCAmelCase_	   =       temp

          UpperCAmelCase_   ,			UpperCAmelCase_	   =       _in_place_partition(snake_case_ ,   snake_case_ ,   snake_case_      )
          count += _in_place_quick_sort(snake_case_ ,   snake_case_ ,   p - 1      )
          count += _in_place_quick_sort(snake_case_ ,   p + 1 ,   snake_case_      )
     return count





def      lowerCAmelCase_    ( snake_case_	:			List[Any] ,   snake_case_	:			Dict ,   snake_case_	:			List[str]      )   ->				Optional[int]:


     '''simple docstring'''




     UpperCAmelCase_	   =       0
     UpperCAmelCase_	   =       randint(snake_case_ ,   snake_case_      )
     UpperCAmelCase_	   =       a[end]
     UpperCAmelCase_	   =       a[pivot]
     UpperCAmelCase_	   =       temp
     UpperCAmelCase_	   =       start - 1
     for index in range(snake_case_ ,   snake_case_      ):
          count += 1
          if a[index] < a[end]:  # check if current val is less than pivot value
               UpperCAmelCase_	   =       new_pivot_index + 1
               UpperCAmelCase_	   =       a[new_pivot_index]
               UpperCAmelCase_	   =       a[index]
               UpperCAmelCase_	   =       temp

     UpperCAmelCase_	   =       a[new_pivot_index + 1]
     UpperCAmelCase_	   =       a[end]
     UpperCAmelCase_	   =       temp
     return new_pivot_index + 1, count


SCREAMING_SNAKE_CASE_:					List[str]  =TemporaryFile()
SCREAMING_SNAKE_CASE_:					int  =1_00  # 1000 elements are to be sorted


SCREAMING_SNAKE_CASE_,    SCREAMING_SNAKE_CASE_:					str  =0, 1  # mean and standard deviation
SCREAMING_SNAKE_CASE_:					List[str]  =np.random.normal(mu, sigma, p)
np.save(outfile, X)
print('The array is')
print(X)


outfile.seek(0)  # using the same array
SCREAMING_SNAKE_CASE_:					str  =np.load(outfile)
SCREAMING_SNAKE_CASE_:					List[Any]  =len(M) - 1
SCREAMING_SNAKE_CASE_:					Dict  =_in_place_quick_sort(M, 0, r)

print(
    'No of Comparisons for 100 elements selected from a standard normal distribution'
    'is :'
)






print(z)




