题目描述
Vishu has a packet of single digit "1". After experimenting on it, Vishu found a weird property of the packet that is whenever he tosses the packet in the air then each digit "1" present in the packet changed to digit "0" and each digit "0" present in the packet changed to "01".
Vishu found it interesting and immediately asked a question to deepika : "How many 1's and 0's will be in the packet if she tosses the packet M times ?"
Input :
The first line contains the number of test cases T . Each test case consists of a positive integer - M .
Output :
For each test case output two space-separated integers, number of 1's and number of 0's in the packet after M tosses.
Constraints :
1 ≤ T ≤20
1 ≤ M ≤90
SAMPLE INPUT
2
1
2
SAMPLE OUTPUT
0 1
1 1
输入格式
见题面
输出格式
见题面
样例输入
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
样例输出
0 1
1 1
1 2
2 3
3 5
5 8
8 13
13 21
21 34
34 55
55 89
89 144
144 233
233 377
377 610
610 987
987 1597
1597 2584
2584 4181
4181 6765