LOCKER  Magic of the locker
Vertu, the clever businessman, sells the ropes to his customers at the rate of 1 rupee per meter. He can only sell an integer length of a rope to a customer. Also, he has a magic locker which functions this way:
Suppose the locker has 'x' rupees. Now if 'y' rupees more are put into this locker, it multiplies them and total money in the locker now is 'x × y'.
This morning, Vertu starts his bussiness with 'n' meters of rope. He puts 1 rupee in the locker as to have good luck.
Find the maximum money he can earn today considering that he sold all of his rope at the end of the day.
NOTE: Vertu has to put all rupees into the locker as soon as he gets it, and can get rupees from locker only at the end of the day.
Input and Output
The first line contains t, the number of test cases. t lines follow, each containing one positive integer n. For each of these integers, print the required answer modulo (10^{9}+7).Constraints
t < 10^{5}
0 < n < 10^{12}
Example
Input: 2 4 5 Output: 4 6
hide comments
Shipu Ahamed:
20131220 08:21:50
@Akhilesh Anandh : N always be greater than zero........ see problem statement. 

ABHISHEK KUMAR:
20131220 08:21:50
that feeling when u get AC in 1 go....:) 

Akhilesh Anandh:
20131220 08:21:50
@Lalit Kundu: Please check my code.. I'm getting WA on the 2nd input file. My code is running fine on my computer as well as ideone. Submission id: 9694729.


parikh:
20131220 08:21:50
can any one provide with test cases... Last edit: 20130705 05:26:12 

stranger:
20131220 08:21:50
if you are sure that your code is ok, but you getting WA, then just test your code on http://ideone.com/. the code, that works perfectly on my computer, gives vars overflow on spoj machine Last edit: 20130704 20:58:51 

vilay:
20131220 08:21:50
nice problem Last edit: 20130620 06:02:26 

Rahul Shah:
20131220 08:21:50
******************...:(


Amit :
20131220 08:21:50
modulo costed me 5 WA....finally got AC :)


Pragya Mishra:
20131220 08:21:50
not dat easy... ;) got the logic at first sight but implementing it and the lack of idea of modular algo costed me many WAs.... phewww.. finallyyy AC!! :D 
Added by:  darkshadows 
Date:  20130328 
Time limit:  1s 
Source limit:  5000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem 