详情

#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7,N=3;
int t,n;
struct Matrix{
	int a[N+2][N+2];
	void clear(){memset(a,0,sizeof a);}
	void init(){for(int i=1;i<=n;i++) a[i][i]=1;}
	void init_(){a[1][1]=1,a[1][3]=1,a[2][1]=1,a[3][2]=1;}
}res;
Matrix x;
Matrix operator*(const Matrix &a,const Matrix &b){
	Matrix c;c.clear();
	for(int i=1;i<=N;i++)
		for(int j=1;j<=N;j++)
			for(int k=1;k<=N;k++)
				c.a[i][j]=(c.a[i][j]+(a.a[i][k]*b.a[k][j])%mod)%mod;
	return c;
} 
inline Matrix qpow(Matrix x,int y){
	res.clear(),res.init();
	for(;y;y>>=1,x=x*x)
		if(y&1) res=res*x;
	return res;
}
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		x.clear(),x.init_();
		if(n<=3) cout<<1<<endl;
		else{
			qpow(x,n);
			cout<<(long long)(res.a[2][1])<<endl;
		}
	}
	return 0;
}