human
Perfect Square factors of a Number | Function that returns the count of factors that are perfect squares.
Stores the count of number of times a prime number divides N ..
Stores the number of factors that are perfect square.
Count number of 2 's  that divides N.
Calculate ans according to above formula.
Check for all the possible numbers that can divide it.
Check the number of times prime number i divides it.
Calculate ans according to above formula.
Return final count.
Driver Code"
Solution in Python:
assistant
#Here is code to perfect Square factors of a Number and the other steps required.
 def noOfFactors ( N ) :
	if ( N == 1 ) :
		return 1
	count = 0
	ans = 1
	while ( N % 2 == 0 ) :
		count += 1
		N = N // 2
	ans *= ( count // 2 + 1 )
	i = 3
	while i * i <= N :
		count = 0
		while ( N % i == 0 ) :
			count += 1
			N = N // i
		ans *= ( count // 2 + 1 )
		i += 2
	return ans
if __name__ == " _ _ main _ _ " :
	N = 100
	print ( noOfFactors ( N ) )