HackerRank - Sherlock and Divisors
Introduction
Watson gives an integer N to Sherlock and asks him: What is the number of divisors of N that are divisible by 2?
Input and Output Format
# Input:
2
9
8
# Output:
0
3
Explanation
9 has three divisors 1, 3 and 9 none of which is divisible by