Divisor Product
##### Submissions: 822   Accuracy: 19.99%   Difficulty: Easy   Marks: 2

Ishaan is playing with divisors of a number N. He is curious about the product of all these divisors. Given a number N, help him find the product of all the divisors of N (including N).
Since the products can be large, print the answer modulo (109+ 7).
Note : Since N takes large values, brute force won't work.

Input :
First line of input contains a single integer T denoting the number of test cases.The only line of each test case contains an integer N.

Output :
For each test case, print the required answer in a new line.

Constraints :
1 <= T <= 200
1 <= N <= 109

Example :
Input :

3
6
9
12
Output :
36
27
1728

Explanation :
Case 1 :

Divisors of 6 : 1, 2, 3, 6
Product = 1*2*3*6 = 36

Case 2 :
Divisors of 9 : 1, 3, 9
Product = 1*3*9 = 27

Case 3 :
Divisors of 12 : 1, 2, 3, 4, 6, 12
Product = 1*2*3*4*6*12 = 1728

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Anubhav Goyal
Author: goyalanubhav11

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.