


def 				_lowercase     (		SCREAMING_SNAKE_CASE_ :		List[Any]							,	SCREAMING_SNAKE_CASE_ :		Any						):





			"""simple docstring"""




			while b:
						UpperCamelCase	,	UpperCamelCase								=       b, a % b
			return a






def 				_lowercase     (		SCREAMING_SNAKE_CASE_ :		List[str]							,	SCREAMING_SNAKE_CASE_ :		int						):





			"""simple docstring"""




			return a if b == 0 else euclidean_gcd_recursive(A__							,	a % b						)






def 				_lowercase     (		):





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






'''simple docstring'''
from typing import Any







class   a_ :




			def __init__(       self					,   UpperCAmelCase	):
				a_      				=						data
				a_      				=						None







class   a_ :




			def __init__(       self	):
				a_      				=						None




			def 					lowerCAmelCase__					(       self	):
				a_      				=						self.head
				while temp is not None:
					print(temp.data					,   end=""" """	)
					a_      				=						temp.next
				print()




			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase	):
				a_      				=						Node(UpperCAmelCase	)
				a_      				=						self.head
				a_      				=						new_node






			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase					,   UpperCAmelCase	):
				if node_data_a == node_data_a:
					return
				else:
					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					if node_a is None or node_a is None:
						return

					a_				,  a_      				=						node_a.data, node_a.data


if __name__ == "__main__":
		lowercase__											=LinkedList()
		for i in range(5, 0, -1):
				ll.push(i)

		ll.print_list()

		ll.swap_nodes(1, 4)
		print('After swapping')
		ll.print_list()
