def divisor(n):
    count = 0
    for i in range(1, abs(n) + 1):
        if n % i == 0:
            count += 1
    return count