#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100;
ll ans[maxn];
void init()
{
ans[1] = 1; ans[2] = 2;
for(int i=3;i<=80;i++) ans[i] = ans[i-1]+ans[i-2];
}
int main()
{
init();
int caset,n;
scanf("%d",&caset);
while(caset--)
{
scanf("%d",&n);
printf("%lld\n",ans[n]);
}
return 0;
}