You are given an integer n representing a street with n plots on each of its $2$ sides, resulting in a total of $2 imes$ n plots.

On each side of the street, you may place houses on the plots such that no $2$ houses are placed on adjacent plots. A house placed on one side of the street does not affect the placement of houses on the other side.

Return the total number of possible house placements.

Note: Since the answer can be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ n $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.