链接: https://cses.fi/problemset/task/2413

板块: Dynamic Programming

时限: 1.00 s ｜ 内存: 512 MB

题目描述

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.

（题目原页含若干示意图片，此处从略。）

Given $n$, how many different towers can you build? Mirrored and rotated towers are counted separately if they look different.

输入

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

数据范围

$1 \le t \le 100$ $1 \le n \le 10^6$

样例输入

3
2
6
1337

样例输出

8
2864
640403945