human
Check if Euler Totient Function is same for a given number and twice of that number | Function to find the Euler 's Totient Function.
Initialize result as N.
Consider all prime factors of n and subtract their multiples from result.
Return the count.
Function to check if phi ( n ) is equals phi ( 2 * n ).
Driver Code"
How can the above be solved in Python?

=====
Give me a code to check if Euler Totient Function is same for a given number and twice of that number and the other steps required?
assistant
#Here is code to check if Euler Totient Function is same for a given number and twice of that number and the other steps required.
 def phi ( n ) :
	result = 1
	for p in range ( 2 , n ) :
		if ( __gcd ( p , n ) == 1 ) :
			result += 1
	return result
def sameEulerTotient ( n ) :
	return phi ( n ) == phi ( 2 * n )
def __gcd ( a , b ) :
	return a if b == 0 else __gcd ( b , a % b )
if __name__ == ' _ _ main _ _ ' :
	N = 13
	if ( sameEulerTotient ( N ) ) :
		print ( " Yes " )
	else :
		print ( " No " )