KIMO2  simple calculation
the problem statements are very easy just compute the value of x given the value of n .
Input
the first line will contains T the number of test cases , the following T lines will contain the value of n .
1<=T<=10^5
1<= n <10^7
Output
for evey n print the value of x % 10^9+7 .
Example
Input:5151015335 1 5 10 15 33 Output:
1 80 5120 245760 733919781
hide comments
walid_salah:
20160421 19:26:45
peace of cauchen :D


Hussein Aassem:
20150324 09:52:03
the formula of the output needs a pair of parentheses for clarity


aqfaridi:
20130818 09:31:47
expo.. 

Ouditchya Sinha:
20130523 17:02:40
Piece of Cake. AC in 0.13s :) 

Rajarshi Sarkar:
20130518 16:12:19
@Lakshman >> Mayb an overflow ;)


[Lakshman]:
20130518 15:55:16
@abdelkarim can you please tell me why WA..this is simple and on direct formula


[Lakshman]:
20130518 12:41:53
I think this is on direct formula..******** am I wrong..?


(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20130517 20:04:37
AC with less than 123B in C without any opti.. But maybe impossible to pass with slow language.. Last edit: 20130517 18:37:40 
Added by:  abdelkarim 
Date:  20130517 
Time limit:  2s 
Source limit:  5000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  owner 