1. You are given a number N. 2. You have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. 3. You have to find the number of ways to tile a 2*N dimensional floor. Note -> You can also rotate the tiles.
Input Format
A number N
Output Format
Print your answer modulo 10^9+7.
Constraints
1 <= N <= 1000
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
3
Output
5