#include<bits/stdc++.h>
using namespace std;
long long a[100005];
int main()
{int q;
scanf("%d",&q);
a[0]=0;
a[1]=1;
for(int i=2;i<=100;i++)
a[i]=a[i-1]+a[i-2];
while(q--){
int n;
cin>>n;
printf("Fib(%d) = %lld\n",n,a[n]);
}
return 0;
}