


'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		int      ,       UpperCAmelCase_		:		int	):
 while b:
  lowerCamelCase_				,lowerCamelCase_  				=						b, a % b
 return a





def __snake_case      (   UpperCAmelCase_		:		int      ,       UpperCAmelCase_		:		int	):
 return a if b == 0 else euclidean_gcd_recursive(UpperCAmelCase_      ,       a % b	)





def __snake_case      (   ):
 print(F'''euclidean_gcd(3, 5) = {euclidean_gcd(3      ,       5	)}'''	)
 print(F'''euclidean_gcd(5, 3) = {euclidean_gcd(5      ,       3	)}'''	)
 print(F'''euclidean_gcd(1, 3) = {euclidean_gcd(1      ,       3	)}'''	)
 print(F'''euclidean_gcd(3, 6) = {euclidean_gcd(3      ,       6	)}'''	)
 print(F'''euclidean_gcd(6, 3) = {euclidean_gcd(6      ,       3	)}'''	)

 print(F'''euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3      ,       5	)}'''	)
 print(F'''euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5      ,       3	)}'''	)
 print(F'''euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1      ,       3	)}'''	)
 print(F'''euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3      ,       6	)}'''	)
 print(F'''euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6      ,       3	)}'''	)


if __name__ == "__main__":
     main()







'''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())



