**Compilation/Execution Result:**

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 <= 10^{5}

**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.

Author: tanujyadav97

SANJAY5797 | 145 |

Himanshusinghchauhan | 120 |

iharshitmittal | 106 |

Lam Ngoc Pham | 105 |

rishusinha | 103 |

Shashank_Pathak | 652 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 453 |

Vasudha Gupta | 377 |

akhayrutdinov | 4161 |

sanjay05 | 3633 |

Quandray | 2833 |

Ibrahim Nash | 2524 |

Michael Riegger | 2308 |