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
nodir:
20190816 16:20:56
I finally got ACCEPTED.


nodir:
20190816 16:08:17
Does this problem have an O(N) solution?


yagnik_da175:
20190809 15:43:25
AC....


vcode11:
20181209 21:35:56
take n in long in c++ costed me 2 WA 

mag1x_:
20180625 11:55:51
learnt map and optimised power code just to pass tle :3 

chetan4060:
20180103 17:54:58
easy and use up to 1LL<<52:) 

miodziu:
20131220 08:21:50
I finally got ACCEPTED, but...


hiddenman:
20131220 08:21:50
gud 1 (y)....learn a lot..... :) 

KESHAV BANSAL:
20131220 08:21:50
@Lalitkundu pls. tell me y i am getting tle my code id is 9932251

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 