



def 	UpperCamelCase			(     snake_case__ :					Tuple			)			->  list:
			UpperCamelCase					:						Union[str, Any]					=			[True for i in range(n + 1			)]
			UpperCamelCase					:						List[Any]					=			[i - 1 for i in range(n + 1			)]
			UpperCamelCase					:						Optional[Any]					=			[]
			for i in range(2 ,  n + 1			):
						if is_prime[i]:
									primes.append(snake_case__			)
						for j in range(0 ,  len(snake_case__			)			):
									if i * primes[j] >= n:
												break
									UpperCamelCase					:						List[str]					=			False

									if i % primes[j] == 0:
												UpperCamelCase					:						Optional[int]					=			totients[i] * primes[j]
												break

									UpperCamelCase					:						Optional[Any]					=			totients[i] * (primes[j] - 1)

			return totients


if __name__ == "__main__":
				import doctest

				doctest.testmod()








from __future__ import annotations

import sys
def 	UpperCamelCase			(     snake_case__ :					int ,  snake_case__ :					int			)			->  tuple[int, int]:
   # base cases
   if abs(snake_case__			) == 1:
      return a, 0
   elif abs(snake_case__			) == 1:
      return 0, b

   UpperCamelCase			,  UpperCamelCase					:						Dict					=			a, b
   UpperCamelCase			,  UpperCamelCase					:						int					=			1, 0
   UpperCamelCase			,  UpperCamelCase					:						Union[str, Any]					=			0, 1

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

   # sign correction for negative numbers
   if a < 0:
      UpperCamelCase					:						Dict					=			-old_coeff_a
   if b < 0:
      UpperCamelCase					:						Any					=			-old_coeff_b

   return old_coeff_a, old_coeff_b
def 	UpperCamelCase			(     )			->  Tuple:
   if len(sys.argv			) < 3:
      print('2 integer arguments required'			)
      return 1
   UpperCamelCase					:						Union[str, Any]					=			int(sys.argv[1]			)
   UpperCamelCase					:						Optional[int]					=			int(sys.argv[2]			)
   print(extended_euclidean_algorithm(snake_case__ ,  snake_case__			)			)
   return 0


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



