矩阵快速幂

Little Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads. 
Little Q desperately wants to impress his girlfriend, he knows that she will like the necklace only if for every prime length continuous subsequence in the necklace, the number of red beads is not less than the number of blue beads. 
Now Little Q wants to buy a necklace with exactly  nn beads. He wants to know the number of different necklaces that can make his girlfriend happy. Please write a program to help Little Q. Since the answer may be very large, please print the answer modulo  109+7109+7. 
Note: The necklace is a single string,  {not a circle}.

InputThe first line of the input contains an integer  T(1≤T≤10000)T(1≤T≤10000), denoting the number of test cases. 
For each test case, there is a single line containing an integer  n(2≤n≤1018)n(2≤n≤1018), denoting the number of beads on the necklace.OutputFor each test case, print a single line containing a single integer, denoting the answer modulo  109+7109+7.Sample Input

2
2
3

Sample Output

3
4

         递推式: fn=fn-1+fn-3

      fn         1 0 1       fn-1

      fn-1      1 0 0      fn-2

      fn-2      0 1 0      fn-3