Given $q$ queries. Each query gives you an integer $x$, count the number of divisors of $x$.
### Input
- The first line contains an integer $q$.
- The next $q$ lines, each line contains an integer $x$.
### Output
- For each query, print an integer, the number of divisors.
### Constraints
- $1 \le q \le 10^4$.
- $1 \le x \le 10^9$.
### Example
Input:
```
3
4
5
12
```
Output:
```
3
2
6
```
