


'''simple docstring'''

class   snake_case					:





		"""simple docstring"""




		def __init__(					self    ,						UpperCamelCase  ):







			"""simple docstring"""
			lowerCamelCase_  				=						size
			lowerCamelCase_  				=						[0] * size
			lowerCamelCase_  				=						[0] * size






		@staticmethod
		def 						snake_case	(					UpperCamelCase  ):







			"""simple docstring"""
			return index | (index + 1)






		@staticmethod
		def 						snake_case	(					UpperCamelCase  ):







			"""simple docstring"""
			return (index & (index + 1)) - 1






		def 						snake_case	(					self    ,						UpperCamelCase    ,						UpperCamelCase  ):







			"""simple docstring"""
			lowerCamelCase_  				=						value
			while index < self.size:
				lowerCamelCase_  				=						self.get_prev(UpperCamelCase  ) + 1
				if current_left_border == index:
					lowerCamelCase_  				=						value
				else:
					lowerCamelCase_  				=						max(UpperCamelCase    ,						UpperCamelCase    ,						UpperCamelCase  )
				lowerCamelCase_  				=						self.get_next(UpperCamelCase  )







		def 						snake_case	(					self    ,						UpperCamelCase    ,						UpperCamelCase  ):







			"""simple docstring"""
			right -= 1  # Because of right is exclusive
			lowerCamelCase_  				=						0
			while left <= right:
				lowerCamelCase_  				=						self.get_prev(UpperCamelCase  )
				if left <= current_left:
					lowerCamelCase_  				=						max(UpperCamelCase    ,						self.tree[right]  )
					lowerCamelCase_  				=						current_left
				else:
					lowerCamelCase_  				=						max(UpperCamelCase    ,						self.arr[right]  )
					right -= 1
			return result


if __name__ == "__main__":
					import doctest

					doctest.testmod()







'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		int = 1000	):
 return sum(2 * a * ((a - 1) // 2) for a in range(3      ,       n + 1	)	)


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



