1 #include<iostream>
2 #include<cstdio>
3 #include<algorithm>
4 #include<vector>
5 #include<queue>
6 #include<cmath>
7 #include<cstring>
8 using namespace std;
9 const int maxn=1e6+5;
10 const int INF=1e9+7;
11 int n,f[50],m;
12 template <class t>void red(t &x)
13 {
14 x=0;
15 int w=1;
16 char ch=getchar();
17 while(ch<'0'||ch>'9')
18 {
19 if(ch=='-')
20 w=-1;
21 ch=getchar();
22 }
23 while(ch>='0'&&ch<='9')
24 {
25 x=(x<<3)+(x<<1)+ch-'0';
26 ch=getchar();
27 }
28 x*=w;
29 }
30 void input()
31 {
32 freopen("input.txt","r",stdin);
33 }
34 int main()
35 {
36 //input();
37 red(n);
38 f[1]=1;
39 f[2]=1;
40 for(int i=3;i<=40;++i)
41 f[i]=f[i-1]+f[i-2];
42 while(n--)
43 {
44 red(m);
45 printf("%d
",f[m]);
46 }
47 return 0;
48 }