1008

思路：最优就是按2^n-1猜

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int sum,n;
	cin >> sum;
	while (sum--)
	{
		cin >> n;
		long long max = pow(2, n) - 1;
		cout << max << endl;
	}
	return 0;
}