import sys

def main():
    input = sys.stdin.read().split()
    if not input:
        return
    T = int(input[0])
    if T == 0:
        return
    cases = list(map(int, input[1:T+1]))
    max_n = max(cases) if cases else 0
    max_n = max(max_n, 1)  # Ensure at least 1 to handle cases where all N are 0 (though per problem constraints, N >=1)
    
    divisors = [0] * (max_n + 1)
    for i in range(1, max_n + 1):
        for j in range(i, max_n + 1, i):
            divisors[j] += 1
    
    results = []
    for n in cases:
        results.append(str(divisors[n] - 1))
    print('\n'.join(results))

if __name__ == '__main__':
    main()