
"""simple docstring"""





def  lowerCamelCase__						(     __snake_case      )				->						int:


					"""simple docstring"""





					_UpperCamelCase									=    0
					while num > 0:
										digit_sum += num % 10
										num //= 10
					return digit_sum



def  lowerCamelCase__						(     __snake_case = 1_00      )				->						int:


					"""simple docstring"""





					_UpperCamelCase									=    1
					_UpperCamelCase									=    2

					for i in range(2,	max_n + 1      ):
										_UpperCamelCase									=    pre_numerator
										_UpperCamelCase									=    2 * i // 3 if i % 3 == 0 else 1
										_UpperCamelCase									=    cur_numerator
										_UpperCamelCase									=    e_cont * pre_numerator + temp

					return sum_digits(__lowercase      )


if __name__ == "__main__":
				print(F"""{solution() = }""")














def  a__ (__lowercase							:int					,  __lowercase							:int   )		-> int:
				return abs(__lowercase   ) if a == 0 else greatest_common_divisor(b % a					,  __lowercase   )



def  a__ (__lowercase							:int					,  __lowercase							:int   )		-> int:
				while y:  # --> when y=0 then loop will terminate and return x as final GCD.
								_A  ,				_A	:				Union[str, Any]   =      y, x % y
				return abs(__lowercase   )



def  a__ ()		-> Optional[Any]:
				try:
								_A	:				Optional[Any]   =      input('''Enter two integers separated by comma (,): '''   ).split(''','''   )
								_A	:				List[Any]   =      int(nums[0]   )
								_A	:				Optional[int]   =      int(nums[1]   )
								print(
								    f"""greatest_common_divisor({num_a}, {num_a}) = """
								    f"""{greatest_common_divisor(__lowercase					,  __lowercase   )}"""   )
								print(f"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(__lowercase					,  __lowercase   )}"""   )
				except (IndexError, UnboundLocalError, ValueError):
								print('''Wrong input'''   )


if __name__ == "__main__":
	main()



