



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






def  UpperCAmelCase__    (    lowercase__						,       lowercase__   ) ->      int:
						while y:  # --> when y=0 then loop will terminate and return x as final GCD.
												__lowercase	,			__lowercase					=				y, x % y
						return abs(lowercase__   )






def  UpperCAmelCase__    (    ) ->      Dict:
						try:
												__lowercase					=				input("""Enter two integers separated by comma (,): """   ).split(""","""   )
												__lowercase					=				int(nums[0]   )
												__lowercase					=				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()










def  UpperCAmelCase__    (    lowercase__						,       lowercase__						,       lowercase__   ) ->      float:
						__lowercase					=				(num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
						# formula for sum of series
						return total






def  UpperCAmelCase__    (    ) ->      List[str]:
						print(sum_of_series(1						,       1						,       10   )   )


if __name__ == "__main__":
			import doctest

			doctest.testmod()





