Chiaki is interested in an infinite sequence $a_1, a_2, a_3, ...$, which is defined as follows: $$a_n=\begin{cases}1 & n = 1,2 \\ a_{n - a_{n-1}} + a_{n-1 - a_{n-2}} & n \ge 3\end{cases}$$ Chiaki would like to know the sum of the first $n$ terms of the sequence, i.e. $\sum\limits_{i=1}^{n}a_i$. As this number may be very large, Chiaki is only interested in its remainder modulo ($10^9 + 7$).
输入解释
There are multiple test cases. The first line of input contains an integer $T$ ($1 \le T \le 10^5$), indicating the number of test cases. For each test case: The first line contains an integer $n$ ($1 \le n \le 10^{18}$).
输出解释
For each test case, output an integer denoting the answer.