A keeper counts every positive divisor of a lantern batch number.
Task: Count the positive divisors of n, including 1 and n.
Input format: One positive integer n.
Output format: One integer: the divisor count.
Constraints: 1 <= n <= 10^9
Edge rules: Apply the stated zero, tie, boundary, and ordering conventions exactly.