




'''simple docstring'''
def  lowerCamelCase(       SCREAMING_SNAKE_CASE_    )		->		list:
			A_       		=   [True for i in range(n + 1    )]
			A_       		=   [i - 1 for i in range(n + 1    )]
			A_       		=   []
			for i in range(2					,n + 1    ):
						if is_prime[i]:
									primes.append(SCREAMING_SNAKE_CASE_    )
						for j in range(0					,len(SCREAMING_SNAKE_CASE_    )    ):
									if i * primes[j] >= n:
												break
									A_       		=   False

									if i % primes[j] == 0:
												A_       		=   totients[i] * primes[j]
												break

									A_       		=   totients[i] * (primes[j] - 1)

			return totients


if __name__ == "__main__":
							import doctest

							doctest.testmod()










'''simple docstring'''
def  lowerCamelCase(       SCREAMING_SNAKE_CASE_    )		->		list:
			A_       		=   [True for i in range(n + 1    )]
			A_       		=   [i - 1 for i in range(n + 1    )]
			A_       		=   []
			for i in range(2					,n + 1    ):
						if is_prime[i]:
									primes.append(SCREAMING_SNAKE_CASE_    )
						for j in range(0					,len(SCREAMING_SNAKE_CASE_    )    ):
									if i * primes[j] >= n:
												break
									A_       		=   False

									if i % primes[j] == 0:
												A_       		=   totients[i] * primes[j]
												break

									A_       		=   totients[i] * (primes[j] - 1)

			return totients


if __name__ == "__main__":
							import doctest

							doctest.testmod()




