'''simple docstring'''
from __future__ import annotations

import sys







def 			_UpperCamelCase			(  _a						:						Any					,  _a						:						str      ):




    """simple docstring"""



    if abs(lowercase_      ) == 1:
        return a, 0
    elif abs(lowercase_      ) == 1:
        return 0, b

    __UpperCamelCase     ,       __UpperCamelCase						:						str		     =	a, b
    __UpperCamelCase     ,       __UpperCamelCase						:						List[Any]		     =	1, 0
    __UpperCamelCase     ,       __UpperCamelCase						:						List[Any]		     =	0, 1

    while remainder != 0:
        __UpperCamelCase						:						int		     =	old_remainder // remainder
        __UpperCamelCase     ,       __UpperCamelCase						:						Any		     =	remainder, old_remainder - quotient * remainder
        __UpperCamelCase     ,       __UpperCamelCase						:						Union[str, Any]		     =	coeff_a, old_coeff_a - quotient * coeff_a
        __UpperCamelCase     ,       __UpperCamelCase						:						Optional[int]		     =	coeff_b, old_coeff_b - quotient * coeff_b

    # sign correction for negative numbers
    if a < 0:
        __UpperCamelCase						:						Optional[int]		     =	-old_coeff_a
    if b < 0:
        __UpperCamelCase						:						Tuple		     =	-old_coeff_b

    return old_coeff_a, old_coeff_b







def 			_UpperCamelCase			(  ):




    """simple docstring"""



    if len(sys.argv      ) < 3:
        print('2 integer arguments required'      )
        return 1
    __UpperCamelCase						:						Union[str, Any]		     =	int(sys.argv[1]      )
    __UpperCamelCase						:						List[str]		     =	int(sys.argv[2]      )
    print(extended_euclidean_algorithm(lowercase_					,  lowercase_      )      )
    return 0


if __name__ == "__main__":
  raise SystemExit(main())








"""simple docstring"""


from itertools import permutations

def 					_lowerCAmelCase (  lowercase_ = 5		):
						if gon_side < 3 or gon_side > 5:
												raise ValueError('gon_side must be in the range [3, 5]'		)

						# Since it's 16, we know 10 is on the outer ring
						# Put the big numbers at the end so that they are never the first number
						UpperCAmelCase			 =					list(range(gon_side + 1						,      0						,      -1		)		)
						UpperCAmelCase			 =					list(range(gon_side + 2						,      gon_side * 2 + 1		)		)

						for perm in permutations(small_numbers + big_numbers		):
												UpperCAmelCase			 =					generate_gon_ring(lowercase_						,      list(lowercase_		)		)
												if is_magic_gon(lowercase_		):
																		return int(''.join(str(lowercase_		) for n in numbers		)		)

						UpperCAmelCase			 =					F"""Magic {gon_side}-gon ring is impossible"""
						raise ValueError(lowercase_		)

def 					_lowerCAmelCase (  lowercase_						,      lowercase_		):
						UpperCAmelCase			 =					[0] * (gon_side * 3)
						UpperCAmelCase			 =					perm[0:3]
						perm.append(perm[1]		)

						UpperCAmelCase			 =					1 if gon_side < 5 else 2

						for i in range(1						,      len(lowercase_		) // 3 + magic_number		):
												UpperCAmelCase			 =					perm[2 * i + 1]
												UpperCAmelCase			 =					result[3 * i - 1]
												UpperCAmelCase			 =					perm[2 * i + 2]

						return result

def 					_lowerCAmelCase (  lowercase_		):
						if len(lowercase_		) % 3 != 0:
												raise ValueError('a gon ring should have a length that is a multiple of 3'		)

						if min(numbers[::3]		) != numbers[0]:
												return False

						UpperCAmelCase			 =					sum(numbers[:3]		)

						return all(sum(numbers[i : i + 3]		) == total for i in range(3						,      len(lowercase_		)						,      3		)		)


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





