def udivisor_count(n):
 if (n == 0):
  return 0
 return (2 ** len([p for p in factorint(n) if (p > 1)]))

def udivisor_count ( n ) : if ( n == 0 ) : return 0 return ( 2 ** len ( [ p for p in factorint ( n ) if ( p > 1 ) ] ) )
return the number of unitary divisors of n .