#include<stdio.h>
/*
int fun(int m)
{ //然而我没有看出这是 斐波拉基 然后就超时了
if (m == 2)
return 1;
else if (m == 3)
return 2;
else
return fun(m-2) + fun(m-1);
}
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
int m, ans = 0, num = 0;
scanf("%d", &m);
printf("%d\n", fun(m));
}
}
*/
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
int m;
int d[41];
d[1] = 1;
d[2] = 2;
scanf("%d", &m);
for (int i = 3; i < m; i++)
d[i] = d[i-1] + d[i-2];
printf("%d\n", d[m-1]);
}
return 0;
}
/*
int fun(int m)
{ //然而我没有看出这是 斐波拉基 然后就超时了
if (m == 2)
return 1;
else if (m == 3)
return 2;
else
return fun(m-2) + fun(m-1);
}
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
int m, ans = 0, num = 0;
scanf("%d", &m);
printf("%d\n", fun(m));
}
}
*/
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
int m;
int d[41];
d[1] = 1;
d[2] = 2;
scanf("%d", &m);
for (int i = 3; i < m; i++)
d[i] = d[i-1] + d[i-2];
printf("%d\n", d[m-1]);
}
return 0;
}