Geek and his Binary Strings
##### Submissions: 655   Accuracy: 21.33%   Difficulty: Easy   Marks: 2

Geek likes binary Strings consisting of only ones and zeros . He particularly likes those Binary strings in which each prefix of the string have more 1's than 0's. He calls such a string as Lovely String.
For
example: The String 110100 is Lovely, Because all of the prefixes of this string have more ones than zeroes. Now, Geek wants to know how many total Lovely strings of length 2*n are possible to form. Output the Answer modulo (1000000007).
Input:
The first line contains an
integer'T'-denoting the number of test cases.
Each of the next T lines containing an integer -
'n'.
Output:
For each of the
testcases, Output the total number of distinct Lovely strings that can be formed of length 2*n.
Constraints:
1<=T<=10000
1<=n<=1000

Example:
Input:

1
3
Output:
5
Explanation:

111000 101100 101010 110010 110100 are the five Lovely Strings that can be formed of length 6.

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

Author: iamabjain

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.