题目描述
Given an integer N print total number of divisors of N. It is guaranteed that N is a multiple of prime numbers less than 10^6.
Input
First line contains T (number of test cases).
Next T lines contains integer N.
Constraints
1 ≤ T ≤ 100
1 ≤ N ≤ 10^18
SAMPLE INPUT
6
1
2
3
4
5
20
SAMPLE OUTPUT
1
2
2
3
2
6
输入格式
见题面
输出格式
见题面
样例输入
100
18550591488000
5711231877120
6878740796928
2550240000000
3505420800000
9680186880000
5088365568000
1474015885056
1288242144000
5324102784000
7052897280000
7645192128000
7944134994432
2828429604000
3104956800000
7192209024000
1420164900000
7382416204800
4438620426240
1059687383040
9158123520000
6513959088000
2067243171840
3170192256000
1360604044800
21636496284480
5408363520000
1223468064000
1664796672000
4815110551680
6586272000000
1401558681600
16970577624000
21016195200000
9401204736000
7970296320000
1385826900480
2638747238400
21525678720000
1039346380800
11425075200000
2627922528000
2414168064000
3256979544000
1256650200000
2161656315000
1525620096000
5003135444736
1340776800000
3418953753600
20551781376000
2256771132000
8710712524800
1216630800000
2290579200000
1199278080000
1474387687500
3743288640000
1084577195520
9982692720000
1190917728000
9466745127840
8979141600000
16538908438800
2898678182400
4090074912000
1351150295040
1976716836864
3777725952000
1352254176000
1038227742720
8712168192000
2952069120000
2648040595200
1850688000000
3107744640000
3337293960000
1099308672000
1500415488000
6308507205000
1584297792000
6725182464000
4139553600000
4959401743296
8385820115400
1593350922240
3249005760000
3325639680000
1303375417344
8616063456000
6705546120000
6197583974400
1213976332800
3485859300000
4411543500000
4633251840000
9503523469440
4262084386560
3319481088000
1115474976000
样例输出
8
8
8
1
1
1
8
8
8
8
8
1
8
4
8
8
8
4
8
4
8
8
4
8
1
2
8
1
2
8
2
8
8
8
1
1
8
8
8
1
8
4
8
8
8
1
8
8
8
8
1
8
1
8
8
8
8
2
8
8
8
8
8
8
8
16
8
8
8
8
8
2
8
2
4
8
8
8
8
8
2
8
1
8
8
8
2
8
8
2
8
8
1
8
2
1
4
8
16
8