Your task is to build a tower whose width is 2 and height is n. You have an unlimited supply of blocks whose width and height are integers.
The first input line contains an integer t: the number of tests.
After this, there are t lines, and each line contains an integer n: the height of the tower.
For each test, print the number of towers modulo 10^9+7.
3 2 6 1337
8 2864 640403945
Can anyone help me how can i solve this question any approach will be helpful **for full problem visit https://cses.fi/problemset/task/2413**