#include <bits/stdc++.h>
using namespace std;

long long dp[101];

long long fib(int n){
    if(n <= 2) return 0;
    if(dp[n] == -1) {
        dp[n] = 0;
        dp[n] = fib(n-1) + fib(n-2) + 1;
    }

    return dp[n];
}
int main(){
    int n,x;
    cin>>x;
    memset(dp, -1, sizeof(dp));
    for(int i=0;i<x;i++){
        cin>>n;
        cout << 1+fib(n) << "\n";
    }

    return 0;
}