a = [2**i for i in range(1, 31)]
for _ in range(int(input())):
n = int(input())
b = [a[n - 1]] + a[:(n//2) - 1]
c = a[(n//2) - 1:n-1]
print(sum(b) - sum(c))
/// *** --- | In the name of ALLAH ||| --- *** ///
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)x.size()
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu ()
{
cerr << endl;
}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest)
{
cerr << arg << ' ';
faltu(rest...);
}
ll gcd ( ll a, ll b )
{
return __gcd ( a, b );
}
ll lcm ( ll a, ll b )
{
return a * ( b / gcd ( a, b ) );
}
int main()
{
optimize();
int t,a,d,f,s;
cin >> t;
while(t--)
{
int n;
cin >> n;
a=n/2;
f=pow(2,n);
for(int i=1;i<a;i++){
f=f+pow(2,i);
}
s=0;
for(int i=a;i<n;i++){
s=s+pow(2,i);
}
int d=f-s;
cout<<d<<endl;
}
return 0;
}
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |
902. Numbers At Most N Given Digit Set | 221. Maximal Square |
1200. Minimum Absolute Difference | 1619B - Squares and Cubes |
1619A - Square String | 1629B - GCD Arrays |
1629A - Download More RAM | 1629C - Meximum Array |
1629D - Peculiar Movie Preferences | 1629E - Grid Xor |