algo2017_week11_fabonacci

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fo(n) for(int i=0;i<n;i++)
#define fos(o,n) for(int i=o;i<=n;i++)

int a[400];

void build(){
    fos( 2 , 400 ) a[i] = a[i - 1] + a[i - 2];
}

int main(){

    int T;
    cin >> T;

    a[0] = 0;
    a[1] = 1;

    build();

    while( T-- ){
        int n;
        cin >> n;
        cout << a[n] << endl;
    }

    return 0;
}