* Random Heaps
A list is filled with N random and distinct Integers. Find the number of ways
in which a min-heap can be created for the list. Since the answer can be huge,
you need to output the answer modulo 10^9+7.
* Input Format
The first line of input denotes the number of test cases T. Each subsequent line
denotes a test case with integer N.
* Output Format
For each Test Case, output the number of ways in which a min-heap can be
created for the given N modulo 10^9+7
* Sample Input
* Sample Output
Problem Setter : Nimesh Ghelani