南工No.88 汉诺塔（一）

//每天AC一道题，一年365道题，你就能成为一个编程高手

http://acm.nyist.net/JudgeOnline/problem.php?pid=88

//内存过多

/*#include<iostream>
#include<vector>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
//void print(int a){cout<<a<<" ";}
int main()
{
 int time;cin>>time;
 vector<int>a(1,1);
 while(time--)
 {
  int con;cin>>con;
  if(a.size()>=con){cout<<a[con-1]<<endl;continue;}
  int i;
  for(i=a.size();i<con;i++)
  {
   int t=(a[i-1]*2+1)%1000000;
   a.push_back(t);
  }
  cout<<a[i-1]<<endl;
 }
 return 0;
}*/

//超时
/*#include<iostream>
#include<vector>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
//void print(int a){cout<<a<<" ";}
int main()
{
 int time;cin>>time;
 while(time--)
 {
  int con;cin>>con;
  int i,num=0;
  for(i=0;i<con;i++)
  {
   num=(num*2+1)%1000000;
  }
  cout<<num<<endl;
 }
 return 0;
}*/

//AC。

//这里有快速幂的传送门
//http://blog.csdn.net/whjkm/article/details/42803805

#include<iostream>
#include<vector>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
//void print(int a){cout<<a<<" ";}
int main()
{
	int time;cin>>time;
	while(time--)
	{
		int con;cin>>con;//num=2^con-1;
	    long long num=1,a=2;
		while(con)
		{
			if(con%2)
				num=num*a%10000000;
			con/=2;
			a=a*a%10000000;
		}
		num=num%1000000-1;
		cout<<num<<endl;
	}
	return 0;
}