Happy Necklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 264 Accepted Submission(s): 89
Problem Description
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 $n$ 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 $10^9+7$.
Note: The necklace is a single string, {not a circle}.
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 $n$ 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 $10^9+7$.
Note: The necklace is a single string, {not a circle}.
Input
The first line of the input contains an integer $T(1\leq T\leq10000)$, denoting the number of test cases.
For each test case, there is a single line containing an integer $n(2\leq n\leq 10^{18})$, denoting the number of beads on the necklace.
For each test case, there is a single line containing an integer $n(2\leq n\leq 10^{18})$, denoting the number of beads on the necklace.
Output
For each test case, print a single line containing a single integer, denoting the answer modulo $10^9+7$.
Sample Input
2 2 3
Sample Output
3 4