/*****************************************
Author :Crazy_AC(JamesQi)
Time :2015
File Name :
: i (i- 1) (i- 2) ;
(i- 1) , dp[i] = dp[i - 1]; i 2 * 1 ;
(i- 2) , 2*2 , 3 , ,2 * 1,2 * 2,1 * 2, 1 * 2 , , , (i- 1) 1 * 2 ( dp[i - 2] ), dp[i] = dp[i - 2] * 2 + dp[i - 1];
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int dp[N];
int n;
int T;
int main()
{
// ios::sync_with_stdio(false);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
cin >> T;
while(T--){
cin >> n;
dp[0] = dp[1] = 1;
for (int i = 2;i <= n;++i)
dp[i] = dp[i - 2] * 2 + dp[i - 1];
cout << dp[n] << endl;
}
return 0;
}