BETA

Difficulty Level:

Medium

Total Submissions: 771 Accuracy:

14.92%

Count possible ways to construct buildings
       

Given N, the number of plots on either sides of the road. Find the total ways to construct buildings in the plots such that there is a space between any 2 buildings. All plots on one side of the road are continuous.
Lets suppose ‘*’ represents a plot, then for N=3, the plots can be represented as * * * | | * * *                               

Where | | represents the road.                                                                                                                                                                  
Note: As the answer can be very large, print it mod 1000000007

Input:
First line of input contains T denoting number of test cases. Only line of each test case contains one integers N, as described above.

Output:
For each test case output a single line containing one integer, the answer to the above problem.

Constraints:
1<= T <= 100000
1<= N <= 105

Example:
Input:

1
3

Output:
25

Explanation:
3 plots, which means possible ways for one side are BSS, BSB, SSS, SBS, SSB where B represents a building and S represents an empty space

Total possible ways are 25, because a way to place on one side can correspond to any of 5 ways on other side.

 

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

Contributor: Tanuj Yadav

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.