Problem Description
This is Kolakosiki sequence:
1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1……
.
This sequence consists of 1
and 2
,
and its first term equals 1
.
Besides, if you see adjacent and equal terms as one group, you will get
1,22,11,2,1,22,1,22,11,2,11,22,1……
.
Count number of terms in every group, you will get the sequence itself. Now, the sequence can be uniquely determined. Please tell HazelFan its
n
th
element.
Input
The first line contains a positive integer
T(1≤T≤5)
,
denoting the number of test cases.
For each test case:
A single line contains a positive integer n(1≤n≤10
7
)
.
For each test case:
A single line contains a positive integer n(1≤n≤10
Output
For each test case:
A single line contains a nonnegative integer, denoting the answer.
A single line contains a nonnegative integer, denoting the answer.
Sample Input
2 1 2
Sample Output
1 2
分析
1e7以为有循环,各种找规律
(然而并没有发现什么规律)
暴力打表结果过了呵呵
