





"""simple docstring"""



class 	__snake_case      :





 """simple docstring"""


 def __init__(					self      ,		__lowerCamelCase=None						):



     '''simple docstring'''




     __A					:		Union[str, Any]						=  data
     __A					:		Optional[int]						=  None







 def __repr__(					self						):



     '''simple docstring'''




     __A					:		Dict						=  ''''''
     __A					:		Union[str, Any]						=  self
     while temp:
         string_rep += F"""<{temp.data}> ---> """
         __A					:		Optional[Any]						=  temp.next
     string_rep += "<END>"
     return string_rep







def 	__lowercase  (     snake_case_						:						Any		)     ->Union[str, Any]:



    '''simple docstring'''







    if not elements_list:
        raise Exception('''The Elements List is empty'''		)

    # Set first element as Head
    __A					:		str						=  Node(elements_list[0]		)
    __A					:		Any						=  head
    # Loop through elements from position 1
    for data in elements_list[1:]:
        __A					:		Any						=  Node(snake_case_		)
        __A					:		Optional[int]						=  current.next
    return head


a_				=    [1, 3, 5, 32, 44, 12, 43]
print(f'''List: {list_data}''')
print("""Creating Linked List from List.""")
a_				=    make_linked_list(list_data)
print("""Linked List:""")




print(linked_list)











"""simple docstring"""



from __future__ import annotations

import sys







def 	__lowercase  (     snake_case_						:						int       ,snake_case_						:						int		)     ->tuple[int, int]:



    '''simple docstring'''







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

    __A				, __A					:		int						=  a, b
    __A				, __A					:		Any						=  1, 0
    __A				, __A					:		int						=  0, 1

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

    # sign correction for negative numbers
    if a < 0:
        __A					:		Optional[Any]						=  -old_coeff_a
    if b < 0:
        __A					:		List[Any]						=  -old_coeff_b

    return old_coeff_a, old_coeff_b







def 	__lowercase  (     )     ->List[str]:



    '''simple docstring'''







    if len(sys.argv		) < 3:
        print('''2 integer arguments required'''		)
        return 1
    __A					:		Optional[int]						=  int(sys.argv[1]		)
    __A					:		Tuple						=  int(sys.argv[2]		)
    print(extended_euclidean_algorithm(snake_case_       ,snake_case_		)		)
    return 0


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




