human
Find politeness of a number | A function to count all odd prime factors of a given number n.
Eliminate all even prime factor of number of n.
n must be odd at this point , so iterate for only odd numbers till sqrt ( n ).
if i divides n , then start counting of Odd divisors.
If n odd prime still remains then count it.
Driver program to test above function"
Solution in Python:

=====
What is a code to find politeness of a number and the other steps required?
assistant
#Here is code to find politeness of a number and the other steps required.
 def countOddPrimeFactors ( n ) :
	result = 1 ;
	while ( n % 2 == 0 ) :
		n /= 2
	i = 3
	while i * i <= n :
		divCount = 0
		while ( n % i == 0 ) :
			n /= i
			divCount = divCount + 1
		result = result * divCount + 1
		i = i + 2
	if ( n > 2 ) :
		result = result * 2
	return result
def politness ( n ) :
	return countOddPrimeFactors ( n ) - 1 ;
n = 90
print " Politness ▁ of ▁ " , n , " ▁ = ▁ " , politness ( n )
n = 15
print " Politness ▁ of ▁ " , n , " ▁ = ▁ " , politness ( n )