def  snake_case						(__lowercase ,      __lowercase						)	->	int:

						'''simple docstring'''



						while b:
												_snake_case    ,_snake_case						:					str    =   b, a % b
						return a
def  snake_case						(__lowercase ,      __lowercase						)	->	int:

						'''simple docstring'''



						return a if b == 0 else euclidean_gcd_recursive(__lowercase ,      a % b						)
def  snake_case						()	->	int:

						'''simple docstring'''



						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()
def  snake_case						()	->	Dict:

						'''simple docstring'''



						_snake_case						:					List[str]    =   0
						for i in range(1 ,      1_001						):
												total += i**i
						return str(__lowercase						)[-10:]


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