def pow_complexity(num, exp):
 if ((num in (0, 1)) or (exp in (0, 1))):
  return 0
 elif ((num & (num - 1)) == 0):
  return (((exp ** 1.092) * (num.bit_length() ** 1.65)) / 623212911.121)
 else:
  return (((exp ** 1.59) * (num.bit_length() ** 1.73)) / 36864057619.3)

def pow_complexity ( num , exp ) : if ( ( num in ( 0 , 1 ) ) or ( exp in ( 0 , 1 ) ) ) : return 0 elif ( ( num & ( num - 1 ) ) == 0 ) : return ( ( ( exp ** 1.092 ) * ( num . bit_length ( ) ** 1.65 ) ) / 623212911.121 ) else : return ( ( ( exp ** 1.59 ) * ( num . bit_length ( ) ** 1.73 ) ) / 36864057619.3 )
estimate the worst case time pow takes to calculate .