HDU 2256 Problem of Precision 解题报告（矩阵快速幂 + 构造）【根号2+根号3的2n次方模一个数的余】

Problem of Precision

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 844    Accepted Submission(s): 489

 

Problem Description

 

 

Input

The first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains one positive integer n. (1 <= n <= 10^9)

 

 

Output

For each input case, you should output the answer in one line.

 

 

Sample Input

3 1 2 5

 

 

Sample Output

9 97 841

---

---

<