Counting Multiplicative Pairs

Problem Statement:

Given a positive integer n, count the number of ordered pairs of positive integers \( (a, b) \) such that \(1 \leq a, b \leq n\) and \(a \times b = n\). Note that ordered pairs means that \((a, b)\) and \((b, a)\) are considered distinct if \(a \neq b\).

You will be given multiple test cases. For each test case, output the result on a new line.

inputFormat

The first line of input contains a single integer T, the number of test cases. Each of the next T lines contains one integer n.

outputFormat

For each test case, output the number of ordered pairs \( (a, b) \) such that \(1 \leq a, b \leq n\) and \(a \times b = n\), each on a separate line.

## sample

3
6
12
25

4
6
3

</p>