def 			lowercase_				(			_lowerCamelCase							:       int		,	_lowerCamelCase							:       int):
    return abs(_lowerCamelCase) if a == 0 else greatest_common_divisor(b % a		,	_lowerCamelCase)

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

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


if __name__ == "__main__":
      main()









def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> list:
       lowerCamelCase   :      Dict			 =					len(_SCREAMING_SNAKE_CASE    )
       lowerCamelCase   :      Union[str, Any]			 =					[]
       for i in range(len(_SCREAMING_SNAKE_CASE    ) - pat_len + 1    ):
              lowerCamelCase   :      Dict			 =					True
              for j in range(_SCREAMING_SNAKE_CASE    ):
                     if s[i + j] != pattern[j]:
                            lowerCamelCase   :      Optional[int]			 =					False
                            break
              if match_found:
                     position.append(_SCREAMING_SNAKE_CASE    )
       return position


if __name__ == "__main__":
       assert naive_pattern_search('ABCDEFG', 'DE') == [3]
       print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))






