考虑字符串序列 $F_1, F_2, \dots$，定义如下：
$$F_1 = ab$$ $$F_{k+1} = F_k F_k b$$
计算字符串 $F_n$ 的不同子序列个数，结果对 $10^9 + 7$ 取模。
第一行包含一个整数 $t$ ($1 \le t \le 10$)，表示测试用例的数量。 第二行包含 $t$ 个整数 $n$ ($1 \le n \le 10^{18}$)，每个测试用例对应一个 $n$。
对于每个测试用例，输出一个整数作为问题的答案。连续的答案之间用空格隔开。
3 1 2 3
4 17 226
前三个字符串为：$F_1 = ab$，$F_2 = ababb$，以及 $F_3 = ababbababbb$。
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: