#include <bits/stdc++.h>//递推模板题
using namespace std;
int n,a,f[31];
int main(){
    f[1] = 1;
    f[2] = 1;
    for (int i = 3;i <= 30;i++){
        f[i] = f[i - 1] + f[i - 2];
    }
    cin >> n;
    while(n--){
        cin >> a;
        cout << f[a] << endl;
    }
    return 0;
}